DOI: 10.1109/date.2003.1253720
View full text
|
|
Share

Abstract: Abstract: Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfiability (SAT) Solvers, on the other hand, have been gaining ground only recently, with the introduction of efficient implementation procedures. Specifically, while BDDs have been mainly adopted to formally verify the correctness of hardware devices, SAT-based Bounded Model Checking (BMC) has been widely used for debugging.In this paper, we combine BDD and SAT-based methods to increase the efficiency o…

expand abstract