Methods for exploiting SAT solvers in unbounded model checking

In this paper we present new implementation details and benchmarking results for our parallel portfolio solver TopoSAT2. In particular, we discuss ideas and implementation details for the exchange of learned clauses in a massively-parallel SAT solver which is designed to run more that 1, 000 solver threads in parallel. Furthermore, we go back to the roots of portfolio SAT solving, and discuss the impact of diversifying the solver by using different restart- , branching- and clause database management heuristics. We show that these techniques can be used to tune the solver towards different problems. However, in a case study on formulas derived from Bounded Model Checking problems we see the best performance when using a rather simple clause exchange strategy. We show details of these tests and discuss possible explanations for this phenomenon.As computing times on massively-parallel clusters are expensive, we consider it especially interesting to share these kind of experimental results.

Download Full-text

Benchmarking SAT Solvers for Bounded Model Checking

Theory and Applications of Satisfiability Testing - Lecture Notes in Computer Science ◽

10.1007/11499107_25 ◽

2005 ◽

pp. 340-354 ◽

Cited By ~ 14

Author(s):

Emmanuel Zarpas

Keyword(s):

Model Checking ◽

Bounded Model Checking ◽

Sat Solvers

Download Full-text

Efficient Model Checking Timed and Weighted Interpreted Systems Using SMT and SAT Solvers

Agent and Multi-Agent Systems: Technology and Applications - Smart Innovation, Systems and Technologies ◽

10.1007/978-3-319-39883-9_4 ◽

2016 ◽

pp. 45-55 ◽

Cited By ~ 3

Author(s):

Agnieszka M. Zbrzezny ◽

Andrzej Zbrzezny ◽

Franco Raimondi

Keyword(s):

Model Checking ◽

Sat Solvers

Download Full-text

COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES

International Journal of Foundations of Computer Science ◽

10.1142/s0129054110007179 ◽

2010 ◽

Vol 21 (02) ◽

pp. 115-134

Author(s):

GENG-DIAN HUANG ◽

BOW-YAW WANG

Keyword(s):

Model Checking ◽

Software Verification ◽

Boolean Satisfiability ◽

Local Model ◽

Sat Solvers ◽

Proof Search ◽

Software Programs ◽

Context Free ◽

Local Model Checking

A complete SAT-based model checking algorithm for context-free processes is presented. We reduce proof search in local model checking to Boolean satisfiability. Bounded proof search can therefore be performed by SAT solvers. Moreover, the completeness of proof search is reduced to Boolean unsatisfiability and hence can be checked by SAT solvers. By encoding the local model checking algorithm in [13], SAT solvers are able to verify properties in the universal fragment of alternation-free µ-calculus formulae on context-free processes. Since software programs can be modeled by context-free processes, our result demonstrates that a purely SAT-based algorithm for software verification is indeed possible.

Download Full-text