3 search results - page 1 / 1 » Testing Satisfiability of CNF Formulas by Computing a Stable... |
CADE
2002
Springer
14 years 5 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
FMCAD
2000
Springer
13 years 8 months ago
2000
Springer
Image computation nds wide application in VLSI CAD, such as state reachability analysis in formal veri cation and synthesis, combinational veri cation, combinational and sequential...
ICCAD
2002
IEEE
14 years 1 months ago
2002
IEEE
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...