The Quest for Efficient Boolean Satisfiability Solvers
Abstract elided by the publisher.
Related papers
- Semantic subtyping with an SMT solver JFP 2012
- Clausal Proofs for Pseudo-Boolean Reasoning TACAS 2022
- Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit TACAS 2005
- Semantic subtyping with an SMT solver ICFP 2010
- Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking CAV 2000
- Scalable error detection using boolean satisfiability POPL 2005
- Saturn: A scalable framework for error detection using Boolean satisfiability TOPLAS 2007
- Quest Complete: The Holy Grail of Gradual Security PLDI 2024