Abstract
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 DiVer verification 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. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Gupta, A., Ganai, M., Wang, C., Yang, Z., & Ashar, P. (2003). Abstraction and BDDs complement SAT-based BMC in DiVer. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2725, 206–209. https://doi.org/10.1007/978-3-540-45069-6_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
