Tuning SAT Checkers for Bounded Model Checking
نویسنده
چکیده
Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search for a counter example in executions whose length is bounded by some integer k. The BMC problem can be eeciently reduced to a propositional satissabil-ity problem, and can therefore be solved by SAT methods rather than BDDs. SAT procedures are based on general-purpose heuristics that are designed for any propositional formula. We show that the unique characteristics of BMC formulas can be exploited for a variety of optimizations in the SAT checking procedure. Experiments with these optimizations on real designs proved their eeciency in many of the hard test cases, comparing to both the standard SAT procedure and a BDD-based model checker.
منابع مشابه
Tuning SAT checkers for Bounded Model Checking
Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search for a counter example in executions whose length is bounded by some integer k. The BMC problem can be e ciently reduced to a propositional satis ability problem, and can therefore be solved by SAT methods rather than BDDs. SAT pr...
متن کاملSat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this regard, but SAT-based model checking, i.e. bounded model checking (BMC), shows some promise. However, unlike traditional model checking, for which time systems have been thoroughly researched, BMC is less capable of mode...
متن کاملFaster FDR Counterexample Generation Using SAT-Solving
With the flourishing development of efficient SAT-solvers, bounded model checking (BMC) has proven to be an extremely powerful symbolic model checking technique. In this paper, we address the problem of applying BMC to concurrent systems involving the interaction of multiple processes running in parallel. We adapt the BMC framework to the context of CSP and FDR yielding bounded refinement check...
متن کاملA View from the Engine Room: Computational Support for Symbolic Model Checking
Symbolic model checking owes much of its success to powerful methods for reasoning about Boolean functions. The first symbolic model checkers used Ordered Binary Decision Diagrams (OBDDs) [1] to represent system transition relations and sets of system states [9]. All of the steps required for checking a model can be expressed as a series of operations on these representations, without ever enum...
متن کاملdescription to be presented at CAV 2004 . SAL 2 ?
SAL 2 augments the specification language and explicit-state model checker of SAL 1 with high-performance symbolic and bounded model checkers, and with novel infinite bounded and witnessmodel checkers. The bounded model checker can use several different SAT solvers, while the infinite bounded model checker similarly can use several different ground decision procedures. SAL 2 provides a scriptab...
متن کامل