Debugging sequential circuits using Boolean satisfiability.
Moayad Fahim AliAndreas G. VenerisAlexander SmithSean SafarpourRolf DrechslerMagdy S. AbadirPublished in: ICCAD (2004)
Keyphrases
- boolean satisfiability
- sat solvers
- sat solving
- boolean optimization
- branch and bound algorithm
- probabilistic planning
- randomly generated
- symmetry breaking
- sat problem
- integer linear programming
- maximum satisfiability
- max sat
- combinatorial problems
- sat instances
- orders of magnitude
- random sat instances
- np hard
- lower bound
- phase transition
- constraint satisfaction problems