A survey of recent advances in SAT-based formal verification
Dramatic improvements in SAT solver technology over the last decade and the growing
need for more efficient and scalable verification solutions have fueled research in …
need for more efficient and scalable verification solutions have fueled research in …
The science of brute force
MJH Heule, O Kullmann - Communications of the ACM, 2017 - dl.acm.org
The science of brute force Page 1 70 COMMUNICATIONS OF THE ACM | AUGUST 2017 |
VOL. 60 | NO. 8 review articles ILL US TRA TION B Y PETER CRO W THER A SSOCIA TE S …
VOL. 60 | NO. 8 review articles ILL US TRA TION B Y PETER CRO W THER A SSOCIA TE S …
PySAT: A Python toolkit for prototyping with SAT oracles
Boolean satisfiability (SAT) solvers are at the core of efficient approaches for solving a vast
multitude of practical problems. Moreover, albeit targeting an NP-complete problem, SAT …
multitude of practical problems. Moreover, albeit targeting an NP-complete problem, SAT …
Multi-shot ASP solving with clingo
M Gebser, R Kaminski, B Kaufmann… - Theory and Practice of …, 2019 - cambridge.org
We introduce a new flexible paradigm of grounding and solving in Answer Set Programming
(ASP), which we refer to as multi-shot ASP solving, and present its implementation in the …
(ASP), which we refer to as multi-shot ASP solving, and present its implementation in the …
The mathsat5 smt solver
MathSAT is a long-term project, which has been jointly carried on by FBK-IRST and
University of Trento, with the aim of developing and maintaining a state-of-the-art SMT tool …
University of Trento, with the aim of developing and maintaining a state-of-the-art SMT tool …
[图书][B] Answer set solving in practice
Answer Set Programming (ASP) is a declarative problem solving approach, initially tailored
to modeling problems in the area of Knowledge Representation and Reasoning (KRR) …
to modeling problems in the area of Knowledge Representation and Reasoning (KRR) …
Model checking
EM Clarke - Foundations of Software Technology and Theoretical …, 1997 - Springer
Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …
such as sequential circuit designs and communication protocols. Specifications are …
SAT-based model checking without unrolling
AR Bradley - … Workshop on Verification, Model Checking, and …, 2011 - Springer
A new form of SAT-based symbolic model checking is described. Instead of unrolling the
transition relation, it incrementally generates clauses that are inductive relative to (and …
transition relation, it incrementally generates clauses that are inductive relative to (and …
An extensible SAT-solver
N Eén, N Sörensson - International conference on theory and applications …, 2003 - Springer
In this article, we present a small, complete, and efficient SAT-solver in the style of conflict-
driven learning, as exemplified by Chaff. We aim to give sufficient details about …
driven learning, as exemplified by Chaff. We aim to give sufficient details about …
On the glucose SAT solver
G Audemard, L Simon - International Journal on Artificial …, 2018 - World Scientific
The set of novelties introduced with the SAT solver Glucose is now considered as a standard
for practical SAT solving. In this paper, we review the different strategies and technologies …
for practical SAT solving. In this paper, we review the different strategies and technologies …