Satisfiability Solvers Are Static Analysers
No abstract available.
Related papers
- Abstract conflict driven learning POPL 2013
- Comparing Solver Representations for Analyzing Cardinality-Based Feature Models GPCE 2026
- Semantic subtyping with an SMT solver JFP 2012
- PMAF: an algebraic framework for static analysis of probabilistic programs PLDI 2018
- On abstraction refinement for program analyses in Datalog PLDI 2014
- Formulog: Datalog for SMT-based static analysis OOPSLA 2020
- The Quest for Efficient Boolean Satisfiability Solvers CAV 2002
- XSat: A Fast Floating-Point Satisfiability Solver CAV 2016