Can BDDs compete with SAT solvers on bounded model checking?
Gianpiero CabodiPaolo CamuratiStefano QuerPublished in: DAC (2002)
Keyphrases
- sat solvers
- bounded model checking
- model checking
- formal verification
- orders of magnitude
- heuristic search
- binary decision diagrams
- constraint satisfaction
- temporal logic
- search space
- max sat
- search strategies
- propositional satisfiability
- sat instances
- linear temporal logic
- sat solving
- search tree
- clause learning
- multi agent systems
- sat problem
- boolean satisfiability
- clause learning sat solvers
- boolean formula
- knowledge compilation
- genetic algorithm
- symmetry breaking
- constraint satisfaction problems
- linear programming
- state space
- sat encodings
- search algorithm
- cooperative
- learning algorithm