Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement

  • Thomas Ball
  • Byron Cook
  • Shuvendu K. Lahiri
  • Lintao Zhang
Conference paper

DOI: 10.1007/978-3-540-27813-9_36

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3114)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Thomas Ball
    • 1
  • Byron Cook
    • 1
  • Shuvendu K. Lahiri
    • 2
  • Lintao Zhang
    • 1
  1. 1.Microsoft Corporation 
  2. 2.Carnegie-Mellon University 

Personalised recommendations