Name
Abstract | ||
|---|---|---|
We develop a framework for model checking infinite-state systems by automatically augmenting them with auxiliary variables, enabling quantifier-free induction proofs for systems that would otherwise require quantified invariants. We combine this mechanism with a counterexample-guided abstraction refinement scheme for the theory of arrays. Our framework can thus, in many cases, reduce inductive reasoning with quantifiers and arrays to quantifier-free and array-free reasoning. We evaluate the approach on a wide set of benchmarks from the literature. The results show that our implementation often outperforms state-of-the-art tools, demonstrating its practical potential. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-72016-2_7 | European Joint Conferences on Theory And Practice of Software |
DocType | Volume | Citations |
Conference | 12651 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Makai Mann | 1 | 1 | 3.06 |
| Ahmed Irfan | 2 | 0 | 0.34 |
| Alberto Griggio | 3 | 624 | 36.37 |
| Oded Padon | 4 | 15 | 2.57 |
| Clark Barrett | 5 | 1268 | 108.65 |