Boolean Satisfiability Solvers and Their Applications in Model Checking

@article{Vizel2015BooleanSS,
  title={Boolean Satisfiability Solvers and Their Applications in Model Checking},
  author={Y. Vizel and Georg Weissenbacher and S. 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
SAT-Based Model Checking
Improving performance of CDCL SAT solvers by automated design of variable selection heuristics
Approximate Reachability
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
Solving linear arithmetic with SAT-based model checking
Solving Dynamic 3-SAT Formula: An Empirical Study
Unlocking the Power of Formal Hardware Verification with CoSA and Symbolic QED: Invited Paper
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 91 REFERENCES
Boolean Satisfiability Solvers: Techniques and Extensions
An Analysis of SAT-Based Model Checking Techniques in an Industrial Environment
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
Inprocessing Rules
A survey of recent advances in SAT-based formal verification
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
Interpolation with Guided Refinement: Revisiting incrementality in SAT-based unbounded model checking
Interpolation-sequence based model checking
On the power of clause-learning SAT solvers as resolution engines
Symbolic Model Checking without BDDs
...
1
2
3
4
5
...