Conference proceeding
Lazy proofs for DPLL(T)-based SMT solvers
2016 Formal Methods in Computer-Aided Design (FMCAD), pp.93-100
10/2016
DOI: 10.1109/FMCAD.2016.7886666
Abstract
With the integration of SMT solvers into analysis frameworks aimed at ensuring a system's end-to-end correctness, having a high level of confidence in these solvers' results has become crucial. For unsatisfiable queries, a reasonable approach is to have the solver return an independently checkable proof of unsatisfiability. We propose a lazy, extensible and robust method for enhancing DPLL(T)-style SMT solvers with proof-generation capabilities. Our method maintains separate Boolean-level and theory-level proofs, and weaves them together into one coherent artifact. Each theory-specific solver is called upon lazily, a posteriori, to prove precisely those solution steps it is responsible for and that are needed for the final proof. We present an implementation of our technique in the CVC4 SMT solver, capable of producing unsatisfiability proofs for quantifier-free queries involving uninterpreted functions, arrays, bitvectors and combinations thereof. We discuss an evaluation of our tool using industrial benchmarks and benchmarks from the SMT-LIB library, which shows promising results.
Details
- Title: Subtitle
- Lazy proofs for DPLL(T)-based SMT solvers
- Creators
- Guy KatzClark BarrettCesare TinelliAndrew ReynoldsLiana Hadarean
- Resource Type
- Conference proceeding
- Publication Details
- 2016 Formal Methods in Computer-Aided Design (FMCAD), pp.93-100
- DOI
- 10.1109/FMCAD.2016.7886666
- Publisher
- FMCAD Inc
- Language
- English
- Date published
- 10/2016
- Academic Unit
- Computer Science
- Record Identifier
- 9984259408602771
Metrics
15 Record Views