@inproceedings{lahiri2006smt,
author = {Lahiri, Shuvendu and Nieuwenhuis, Robert and Oliveras, Albert},
title = {SMT Techniques for Fast Predicate Abstraction},
series = {Lecture Notes in Computer Science},
booktitle = {Conference on Computer Aided Verification (CAV '06)},
year = {2006},
month = {January},
abstract = {Predicate abstraction is a technique for automatically extracting finite-state abstractions for systems with potentially infinite state space. The fundamental operation in predicate abstraction is to compute the best approximation of a Boolean formula ϕ over a set of predicates P. In this work, we demonstrate the use for this operation of a decision procedure based on the DPLL(T) framework for SAT Modulo Theories (SMT). The new algorithm is based on a careful generation of the set of all satisfying assignments over a set of predicates. It consistently outperforms previous methods by a factor of at least 20, on a diverse set of hardware and software verification benchmarks. We report detailed analysis of the results and the impact of a number of variations of the techniques. We also propose and evaluate a scheme for incremental refinement of approximations for predicate abstraction in the above framework.},
publisher = {Springer},
url = {http://approjects.co.za/?big=en-us/research/publication/smt-techniques-for-fast-predicate-abstraction/},
pages = {424-437},
volume = {4144},
isbn = {3-540-37406-X},
edition = {Conference on Computer Aided Verification (CAV '06)},
}