15 search results - page 2 / 3 » Integrating a SAT Solver with an LCF-style Theorem Prover |
CADE
2007
Springer
14 years 5 months ago
2007
Springer
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
CSL
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
CSL
2010
Springer
13 years 6 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
FROCOS
2011
Springer
12 years 4 months ago
2011
Springer
Abstract. Isabelle/HOL is a popular interactive theorem prover based on higherorder logic. It owes its success to its ease of use and powerful automation. Much of the automation is...
ICSE
2003
IEEE-ACM
14 years 5 months ago
2003
IEEE-ACM
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...