State of the art in software verification and witness validation: SV-COMP 2024
D Beyer - International Conference on Tools and Algorithms for …, 2024 - Springer
The 13th edition of the Competition on Software Verification (SV-COMP 2024) was the
largest competition of its kind so far: A total of 76 tools for verification and witness validation …
largest competition of its kind so far: A total of 76 tools for verification and witness validation …
Competition on software verification and witness validation: SV-COMP 2023
D Beyer - International Conference on Tools and Algorithms for …, 2023 - Springer
The 12th edition of the Competition on Software Verification (SV-COMP 2023) is again the
largest overview of tools for software verification, evaluating 52 verification systems from 34 …
largest overview of tools for software verification, evaluating 52 verification systems from 34 …
Progress on software verification: SV-COMP 2022
D Beyer - International Conference on Tools and Algorithms for …, 2022 - Springer
The 11th edition of the Competition on Software Verification (SV-COMP 2022) provides the
largest ever overview of tools for software verification. The competition is an annual …
largest ever overview of tools for software verification. The competition is an annual …
Software verification: 10th comparative evaluation (SV-COMP 2021)
D Beyer - Tools and Algorithms for the Construction and Analysis …, 2021 - Springer
SV-COMP 2021 is the 10th edition of the Competition on Software Verification (SV-COMP),
which is an annual comparative evaluation of fully automatic software verifiers for C and …
which is an annual comparative evaluation of fully automatic software verifiers for C and …
Decomposing software verification into off-the-shelf components: an application to CEGAR
Techniques for software verification are typically realized as cohesive units of software with
tightly coupled components. This makes it difficult to re-use components, and the potential …
tightly coupled components. This makes it difficult to re-use components, and the potential …
Polynomial reachability witnesses via Stellensätze
We consider the fundamental problem of reachability analysis over imperative programs
with real variables. Previous works that tackle reachability are either unable to handle …
with real variables. Previous works that tackle reachability are either unable to handle …
Software model checking: 20 years and beyond
We give an overview of the development of software model checking, a general approach to
algorithmic program verification that integrates static analysis, model checking, and …
algorithmic program verification that integrates static analysis, model checking, and …
CHC-COMP 2023: Competition Report
E De Angelis - arxiv preprint arxiv:2404.14923, 2024 - arxiv.org
CHC-COMP 2023 is the sixth edition of the Competition of Solvers for Constrained Horn
Clauses. The competition was run in April 2023 and the results were presented at the 10th …
Clauses. The competition was run in April 2023 and the results were presented at the 10th …
Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution)
Theta is a model checking framework based on abstraction refinement algorithms. In SV-
COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C …
COMP 2022, we introduce: 1) reasoning at the source-level via a direct translation from C …
Gazer-Theta: LLVM-based Verifier Portfolio with BMC/CEGAR (Competition Contribution)
Gazer-Theta is a software model checking toolchain including various analyses for state
reachability. The frontend, namely Gazer, supports C programs through an LLVM-based …
reachability. The frontend, namely Gazer, supports C programs through an LLVM-based …