15 search results - page 1 / 3 » Integrating a SAT Solver with an LCF-style Theorem Prover |
ENTCS
2006
13 years 4 months ago
2006
TABLEAUX
2005
Springer
13 years 10 months ago
2005
Springer
Unit propagation is one of the most important techniques of efficient SAT solvers. Unfortunately, this technique is not directly applicable to first-order clausal tableaux. We sho...
VLSID
2006
IEEE
14 years 5 months ago
2006
IEEE
Many formal verification tools today are based on Boolean proof techniques. The two most powerful approaches in this context are Binary Decision Diagrams (BDDs) and methods based ...
FM
2008
Springer
13 years 6 months ago
2008
Springer
Declarative specifications exhibit a variety of problems, such as inadvertently overconstrained axioms and underconstrained conjectures, that are hard to diagnose with model checki...
ENTCS
2006
13 years 4 months ago
2006
Effective formal verification tools require that robust implementations of automatic procedures for first-order logic and satisfiability modulo theories be integrated into express...