Can BDDs compete with SAT solvers on bounded model checking?

• 1 January 2002
• proceedings article
• Published by Association for Computing Machinery (ACM) in Proceedings of the 39th conference on Design automation - DAC '02
• p. 117-122
• https://doi.org/10.1145/513945.513949

Abstract

Keywords

• BDDS
• SAT
• FORMAL VERIFICATION
• MODEL CHECKING