Synthesizing History and Prophecy Variables for Symbolic Model Checking

Vick, Cole; McMillan, Kenneth L.

doi:10.1007/978-3-031-24950-1_15

Cited by 2 publications

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Kratos2: An SMT-Based Model Checker for Imperative Programs

Griggio

Jonas

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper describes , a tool for the verification of imperative programs. operates on an intermediate verification language called , with a formally-specified semantics based on smt, allowing the specification of both reachability and liveness properties. It integrates several state-of-the-art verification engines based on sat and smt. Moreover, it provides additional functionalities such as a flexible Python api, a customizable C front-end, generation of counterexamples, support for simulation and symbolic execution, and translation into multiple low-level verification formalisms. Our experimental analysis shows that is competitive with state-of-the-art software verifiers on a large range of programs. Thanks to its flexibility, has already been used in various industrial projects and academic publications, both as a verification back-end and as a benchmark generator.

show abstract

Kratos2: An SMT-Based Model Checker for Imperative Programs

Griggio

Jonas

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Invariant Checking for SMT-Based Systems with Quantifiers

Redondi,

Cimatti,

Griggio

et al. 2024

ACM Trans. Comput. Logic

View full text Add to dashboard Cite

This paper addresses the problem of checking invariant properties for a large class of symbolic transition systems, defined by a combination of SMT theories and quantifiers. State variables can be functions from an uninterpreted sort (finite, but unbounded) to an interpreted sort, such as the the integers under the theory of linear arithmetic. This formalism is very expressive and can be used for modeling parameterized systems, array-manipulating programs, and more. We propose two algorithms for finding universal inductive invariants for such systems. The first algorithm combines an IC3-style loop with a form of implicit predicate abstraction to construct an invariant in an incremental manner. The second algorithm constructs an under-approximation of the original problem, and searches for a formula which is an inductive invariant for this case; then, the invariant is generalized to the original case, and checked with a portfolio of techniques. We have implemented the two algorithms and conducted an extensive experimental evaluation, considering various benchmarks and different tools from the literature. As far as we know, our method is the first capable of handling in a large class of systems in a uniform way. The experiment shows that both algorithms are competitive with the state of the art.

show abstract

Synthesizing History and Prophecy Variables for Symbolic Model Checking

Cited by 2 publications

References 27 publications

Kratos2: An SMT-Based Model Checker for Imperative Programs

Kratos2: An SMT-Based Model Checker for Imperative Programs

Invariant Checking for SMT-Based Systems with Quantifiers

Contact Info

Product

Resources

About