Tighter Integration of {BDDs} and {SMT} for Predicate Abstraction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Tighter Integration of {BDDs} and {SMT} for Predicate Abstraction


We address the problem of computing the exact abstraction of a program with respect to a given set of predicates, a key computation step in Counter-Example Guided Abstraction Refinement. We build on a recently proposed approach that integrates BDD-based quantification techniques with SMT-based constraint solving to compute the abstraction. We extend the previous work in three main directions. First, we propose a much tighter integration of the BDD-based and SMT-based reasoning where the two solvers strongly collaborate to guide the search. Second, we propose a technique to reduce redundancy in the search by blocking already visited models. Third, we present an algorithm exploiting a conjunctively partitioned representation of the formula to quantify. This algorithm provides a general framework where all the presented optimizations integrate in a natural way. Moreover, it allows to overcome the limitations of the original approach that used a monolithic BDD representation of the formula to quantify. We experimentally evaluate the merits of the proposed optimizations, and show how they allow to significantly improve over previous approaches.
No file

Dates and versions

inria-00535785 , version 1 (12-11-2010)


  • HAL Id : inria-00535785 , version 1


Alessandro Cimatti, Anders Franzen, Alberto Griggio, Krishnamani Kalyanasundaram, Marco Roveri. Tighter Integration of {BDDs} and {SMT} for Predicate Abstraction. Design, Automation & Test in Europe, Mar 2010, Dresden, Germany. pp.1707--1712. ⟨inria-00535785⟩
79 View
0 Download


Gmail Facebook Twitter LinkedIn More