Name
Abstract | ||
|---|---|---|
Traditional incremental SAT solvers have achieved great success in the domain of Bounded Model Checking (BMC). Recently, modern solvers have introduced advanced preprocessing procedures that have allowed them to obtain high levels of performance. Unfortunately, many preprocessing techniques such as variable and (blocked) clause elimination cannot be directly used in an incremental manner. This work focuses on extending these techniques and Craig interpolation so that they can be used effectively together in incremental SAT solving (in the context of BMC). The techniques introduced here doubled the performance of our BMC solver on both SAT and UNSAT problems. For UNSAT problems, preprocessing had the added advantage that Craig interpolation was able to find the fixed point sooner, reducing the number of incremental SAT iterations. Furthermore, our ideas seem to perform better as the benchmarks become larger, and/or deeper, which is exactly when they are needed. Lastly, our methods can be integrated into other SAT based BMC tools to achieve similar speedups. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s10703-011-0122-4 | Formal Methods in System Design |
Keywords | Field | DocType |
BMC,Preprocessing,SAT,Model checking,Craig interpolation | Model checking,Computer science,Algorithm,Theoretical computer science,Preprocessor,Solver,Fixed point,Bounded function,Craig interpolation | Journal |
Volume | Issue | ISSN |
39 | 2 | 0925-9856 |
Citations | PageRank | References |
18 | 0.74 | 17 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stefan Kupferschmid | 1 | 72 | 7.05 |
| Matthew Lewis | 2 | 107 | 6.37 |
| Tobias Schubert | 3 | 598 | 37.74 |
| Bernd Becker | 4 | 855 | 73.74 |