STRATEGIES IN FUNCTIONAL VERIFICATION BASED ON SAT AND BDDS

摘要

This paper covers mutual interactions between Boolean Satisfiability (SAT) solvers and Binary Decision Diagrams (BDDs). More precisely, the presentation is focused on approaches mixing methodologies, techniques, and ideas coming from both research domains. First of all, it gives some preliminary definitions and it presents most of the main differences and affinities between SAT and BDD manipulation algorithms. After that, it overviews some of the most notable efforts to integrate the two technologies either in a loose or in a tight way. It eventually provides some evaluations and hints for open problems and possible future work.