Tighter integration of BDDs and SMT for Predicate Abstraction | IEEE Conference Publication | IEEE Xplore

Tighter integration of BDDs and SMT for Predicate Abstraction


Abstract:

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 Abstrac...Show More

Abstract:

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.
Date of Conference: 08-12 March 2010
Date Added to IEEE Xplore: 29 April 2010
ISBN Information:

ISSN Information:

Conference Location: Dresden, Germany

References

References is not available for this document.