Abstraction and BDDs Complement SAT-Based BMC in DiVer

ion and BDDs Complement SAT-based BMC in DiVer Aarti Gupta1, Malay Ganai1 , Chao Wang2, Zijiang Yang1, Pranav Ashar1 1 NEC Laboratories America, Princeton, NJ, U.S.A. 2 University of Colorado, Boulder, CO, U.S.A. Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity for finding bugs in large designs. However, due to its incompleteness, there is a need to perform deeper searches for counterexamples, or a proof by induction where possible. The rification platform uses abstraction and BDDs to complement BMC in the quest for completeness. We demonstrate the effectiveness of our approach in practice on industrial designs.

• Type: Conference
• Year: 2003
• Where: CAV
• Authors: Aarti Gupta, Malay K. Ganai, Chao Wang, Zijiang Yang, Pranav Ashar
• Keywords: CAV 2003, Complement SAT-based BMC, DiVer Aarti, Formal Methods, Platform Uses Abstraction