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

: Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfiability (SAT) Solvers, on the other hand, have been gaining

• Type: Conference
• Year: 2003
• Where: DATE
• Authors: Gianpiero Cabodi, Sergio Nocco, Stefano Quer
• Keywords: Binary Decision Diagrams, DATE 2003, Hardware