82 search results - page 4 / 17 » Selected Methods of Model Checking Using SAT and SMT-Solvers |
CADE
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
PDPTA
2003
13 years 7 months ago
2003
We present a novel approach to parallel Boolean satisfiability (SAT) checking. A distinctive feature of our parallel SAT checker is that it incorporates all essential heuristics ...
DAC
2004
ACM
14 years 7 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
BIRTHDAY
2009
Springer
14 years 1 months ago
2009
Springer
We present a new hybrid BDD and SAT-based algorithm for model checking. Our algorithm is based on backward search, where each pre-image computation consists of an efficient All-SA...
CSL
2010
Springer
13 years 7 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...