Search Results - "Theory of computation~Logic and verification"
-
1
Safety and Robustness for Deep Learning with Provable Guarantees
ISSN: 2643-1572Published: ACM 01.09.2020Published in 2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE) (01.09.2020)“…Computing systems are becoming ever more complex, with decisions increasingly often based on deep learning components. A wide variety of applications are being…”
Get full text
Conference Proceeding -
2
Test Suite Generation for Boolean Conditions with Equivalence Class Partitioning
ISSN: 2575-5099Published: ACM 01.05.2022Published in 2022 IEEE/ACM 10th International Conference on Formal Methods in Software Engineering (FormaliSE) (01.05.2022)“…Boolean test input generation is the process of finding sets of values for variables of a logical expression such that a given coverage criterion is achieved…”
Get full text
Conference Proceeding -
3
Verifying Lock-Free Search Structure Templates (Artifact)
ISSN: 2509-8195Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik 12.09.2024“…We present and verify template algorithms for lock-free concurrent search structures that cover a broad range of existing implementations based on lists and…”
Get full text
Data Set -
4
Reconciling Event Structures with Modern Multiprocessors (Artifact)
ISSN: 2509-8195Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik 06.11.2020“…The artifact is a virtual machine image containing two Coq packages which include mechanization of proofs stated in the paper. The first package imm contains a…”
Get full text
Data Set -
5
Low-Level Bi-Abduction (Artifact)
ISSN: 2509-8195Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik 23.06.2022“…Broom is a new static analyzer for C written in OCaml. Broom primarily aims at open programs, i.e., fragments of programs, with dynamic pointer-linked data…”
Get full text
Data Set -
6
Owicki-Gries Reasoning for C11 RAR (Artifact)
ISSN: 2509-8195Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik 06.11.2020“…The paper "Owicki-Gries Reasoning for C11 RAR" introduces a new proof calculus for the C11 RAR memory model that allows Owicki-Gries proof rules for compound…”
Get full text
Data Set