Boolean Satisfiability Solvers and Their Applications in Model Checking

@article{Vizel2015BooleanSS,
  title={Boolean Satisfiability Solvers and Their Applications in Model Checking},
  author={Yakir Vizel and Georg Weissenbacher and Sharad Malik},
  journal={Proceedings of the IEEE},
  year={2015},
  volume={103},
  pages={2021-2035}
}
Boolean satisfiability (SAT)-the problem of determining whether there exists an assignment satisfying a given Boolean formula-is a fundamental intractable problem in computer science. SAT has many applications in electronic design automation (EDA), notably in synthesis and verification. Consequently, SAT has received much attention from the EDA community, who developed algorithms that have had a significant impact on the performance of SAT solvers. EDA researchers introduced techniques such as… Expand
A comprehensive study and analysis on SAT-solvers: advances, usages and achievements
TLDR
A comprehensive study and analysis of the latest developments in SAT-solver and new approaches that used in branching heuristics, Boolean constraint propagation and conflict analysis techniques during the last two decade are presented. Expand
SAT-Based Model Checking
TLDR
This chapter covers the application of bounded model checking to both hardware and software systems, and to hardware/software co-verification, and means to make BMC complete, including \(k\)-induction, Craig interpolation, abstraction refinement techniques, and inductive techniques with iterative strengthening. Expand
Improving performance of CDCL SAT solvers by automated design of variable selection heuristics
TLDR
Experimental results are provided demonstrating that this system, which evolves variable scoring heuristics using an asynchronous parallel hyper-heuristics approach employing genetic programming, has the potential to create more efficient solvers for particular problem classes. Expand
SAT-based explicit LTLf satisfiability checking
TLDR
This paper presents CDLSC (Conflict-Driven LTL f Satisfiability Checking), a novel algorithm (heuristic) that leverages information produced by propositional SAT solvers, utilizing both satisfiability and unsatisfiability results. Expand
Approximate Reachability
TLDR
A new SAT-based safety model checking framework, named approximate reachability (AR), based on standard reachability analysis, that is able to solve 33 benchmarks that cannot be solved by IC3/PDR and should be considered as a valuable member of any algorithmic portfolio for safety modelchecking. Expand
The Science, Art, and Magic of Constrained Horn Clauses
  • A. Gurfinkel, N. Bjørner
  • Computer Science
  • 2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
  • 2019
TLDR
A framework is presented that reduces symbolically solving Horn clauses to multiple simpler Satisfiability Modulo Theories, SMT, queries and describes advances in SMT that are necessary to make the framework a reality. Expand
Zeon and Idem-Clifford Formulations of Boolean Satisfiability
The Boolean satisfiability problem (SAT) is the problem of determining whether the variables of a given Boolean formula can be consistently replaced by true or false in such a way that the formulaExpand
Solving linear arithmetic with SAT-based model checking
TLDR
LIAMC is a novel decision procedure for (quantifier-free) linear arithmetic over both integers modulo 2N (LIAn) and integers (LIA) based on a transformation of linear arithmetic into safety verification and uses SAT-based model checking to solve the resulting problem. Expand
Solving Dynamic 3-SAT Formula: An Empirical Study
TLDR
It is argued that it is very significant to pay more attention to SAT solvers with the resuming strategy, because many state-of-the-art SATsolvers do not facilitate the previous solutions and might have better performance than a recent solver with the restating strategy. Expand
Unlocking the Power of Formal Hardware Verification with CoSA and Symbolic QED: Invited Paper
TLDR
It is argued that there are many reasons to be optimistic that formal techniques will scale to designs of practical interest, and the CoSA model checker is used as a demonstration platform to illustrate how advances in solvers can improve scalability. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 91 REFERENCES
Boolean Satisfiability Solvers: Techniques and Extensions
TLDR
Boolean Satisfiability (SAT) is the problem of checking if a propositional logic formula can ever evaluate to true and manifests itself in several important application domains such as the design and verification of hardware and software systems, as well as applications in artificial intelligence. Expand
An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment
TLDR
The paper describes eight bounded and unbounded techniques, and analyzes the performance of these algorithms on a large and diverse set of hardware benchmarks. Expand
Verification of proofs of unsatisfiability for CNF formulas
  • E. Goldberg, Y. Novikov
  • Computer Science
  • 2003 Design, Automation and Test in Europe Conference and Exhibition
  • 2003
TLDR
This work describes an efficient procedure for checking the correctness of unsatisfiability proofs and finds an unsatisfiable core of the initial CNF formula. Expand
Inprocessing Rules
TLDR
The formal underpinnings of inprocessing SAT solving are established via an abstract inprocessing framework that covers a wide range of modern SAT solving techniques. Expand
A survey of recent advances in SAT-based formal verification
TLDR
A survey of the latest developments in SAT-based formal verification, including incomplete methods such as bounded model checking and complete methods for model checking, focuses on how the surveyed techniques formulate the verification problem as a SAT problem and how they exploit crucial aspects of a SAT solver. Expand
Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications
  • Lintao Zhang, S. Malik
  • Computer Science
  • 2003 Design, Automation and Test in Europe Conference and Exhibition
  • 2003
TLDR
The implementation of an independent resolution-based checking procedure that can check the validity of unsatisfiable claims produced by the SAT solver zchaff is described and Experimental results show low overhead for the checking process. Expand
Interpolation with Guided Refinement: Revisiting incrementality in SAT-based unbounded model checking
TLDR
The new model checking algorithm (IGR: Interpolation with Guided Refinement), partially takes inspiration from IC3 and interpolation sequences, and bases its robustness and scalability on incremental refinement of state sets, and guided unwinding/simplification of transition relation unrollings. Expand
Interpolation-sequence based model checking
TLDR
This work presents a novel SAT-based approach to full verification that combines BMC with interpolation-sequence in order to imitate BDD-based Symbolic Model Checking and compares favorably with McMillan's interpolation based model checking algorithm. Expand
Symbolic Model Checking without BDDs
TLDR
This paper shows how boolean decision procedures, like Stalmarck's Method or the Davis & Putnam Procedure, can replace BDDs, and introduces a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability. Expand
On the power of clause-learning SAT solvers as resolution engines
TLDR
It is proved that conflict-driven clause-learning SAT solvers yield proof systems that indeed p-simulate general resolution without the need for any additional techniques, and this result can be generalized to certain other practical variations of the solvers, which are based on different learning schemes and restart policies. Expand
...
1
2
3
4
5
...