“Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays” by Makai Mann, Ahmed Irfan, Alberto Griggio, Oded Padon, and Clark Barrett. In Proceedings of the 27^th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '21), (Jan Friso Groote and Kim Guldstrand Larsen, eds.), Mar. 2021, pp. 113-132.
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.
BibTeX entry:
@inproceedings{MIG+21, author = {Makai Mann and Ahmed Irfan and Alberto Griggio and Oded Padon and Clark Barrett}, editor = {Jan Friso Groote and Kim Guldstrand Larsen}, title = {Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays}, booktitle = {Proceedings of the {\it 27^{th}} International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '21)}, series = {Lecture Notes in Computer Science}, volume = {12651}, pages = {113--132}, publisher = {Springer}, month = mar, year = {2021}, doi = {10.1007/978-3-030-72016-2}, url = {http://theory.stanford.edu/~barrett/pubs/MIG+21.pdf} }
(This webpage was created with bibtex2web.)