Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement
- Cite this paper as:
- Ball T., Cook B., Lahiri S.K., Zhang L. (2004) Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement. In: Alur R., Peled D.A. (eds) Computer Aided Verification. CAV 2004. Lecture Notes in Computer Science, vol 3114. Springer, Berlin, Heidelberg
Counterexample-driven abstraction refinement is an automatic process that produces abstract models of finite and infinite-state systems. When this process is applied to software, an automatic theorem prover for quantifier-free first-order logic helps to determine the feasibility of program paths and to refine the abstraction. In this paper we report on a fast, lightweight, and automatic theorem prover called Zapato which we have built specifically to solve the queries produced during the abstraction refinement process.
Unable to display preview. Download preview PDF.