Chapter

Computer Aided Verification

Volume 3114 of the series Lecture Notes in Computer Science pp 457-461

Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement

  • Thomas BallAffiliated withCarnegie Mellon UniversityMicrosoft Corporation
  • , Byron CookAffiliated withCarnegie Mellon UniversityMicrosoft Corporation
  • , Shuvendu K. LahiriAffiliated withCarnegie Mellon UniversityCarnegie-Mellon University
  • , Lintao ZhangAffiliated withCarnegie Mellon UniversityMicrosoft Corporation

* Final gross prices may vary according to local VAT.

Get Access

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.