Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals


Binary Decision Diagrams (BDDs) have been widely used for hardware verification since the beginning of the ý90s, whereas Boolean Satisfiability (SAT) has been gaining ground more recently, with the introduction of Bounded Model Cheking (BMC). In this paper we dovetail BDD and SAT based methods to improve the efficiency of BMC. More specifically, we first… (More)
DOI: 10.3217/jucs-010-12-1693

21 Figures and Tables



Citations per Year

61 Citations

Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics