A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays
[chapter]
2021
Lecture Notes in Computer Science
AbstractWe 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
doi:10.1007/978-3-030-72016-2_7
fatcat:ntdopa3z4nd5rk4c4jc6opyzha