Accelerating Interpolants [chapter]

Hossein Hojjat, Radu Iosif, Filip Konečný, Viktor Kuncak, Philipp Rümmer
2012 Lecture Notes in Computer Science  
We present Counterexample-Guided Accelerated Abstraction Refinement (CEGAAR), a new algorithm for verifying infinite-state transition systems. CEGAAR combines interpolation-based predicate discovery in counterexampleguided predicate abstraction with acceleration technique for computing the transitive closure of loops. CEGAAR applies acceleration to dynamically discovered looping patterns in the unfolding of the transition system, and combines overapproximation with underapproximation. It
more » ... cts inductive invariants that rule out an infinite family of spurious counterexamples, alleviating the problem of divergence in predicate abstraction without losing its adaptive nature. We present theoretical and experimental justification for the effectiveness of CEGAAR, showing that inductive interpolants can be computed from classical Craig interpolants and transitive closures of loops. We present an implementation of CEGAAR that verifies integer transition systems. We show that the resulting implementation robustly handles a number of difficult transition systems that cannot be handled using interpolation-based predicate abstraction or acceleration alone. Supported by the Rich Model Toolkit initiative, http://richmodels.org, the Czech Science Foundation (projects P103/10/0306 and 102/09/H042), the Czech Ministry of Education (COST OC10009 and MSM 0021630528), the BUT project FIT-S-12-1 and the Microsoft Innovation Cluster for Embedded Software.
doi:10.1007/978-3-642-33386-6_16 fatcat:d2yigewvorctvcjlnqlsvk23sm