Lazy proofs for DPLL(T)-based SMT solvers

Guy Katz, Clark Barrett, Cesare Tinelli, Andrew Reynolds, Liana Hadarean

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

20 Scopus citations

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.

Original languageAmerican English
Title of host publicationProceedings of the 16th Conference on Formal Methods in Computer-Aided Design, FMCAD 2016
EditorsRuzica Piskac, Muralidhar Talupur
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages93-100
Number of pages8
ISBN (Electronic)9780983567868
DOIs
StatePublished - 24 Mar 2017
Externally publishedYes
Event16th Conference on Formal Methods in Computer-Aided Design, FMCAD 2016 - Mountain View, United States
Duration: 3 Oct 20166 Oct 2016

Publication series

NameProceedings of the 16th Conference on Formal Methods in Computer-Aided Design, FMCAD 2016

Conference

Conference16th Conference on Formal Methods in Computer-Aided Design, FMCAD 2016
Country/TerritoryUnited States
CityMountain View
Period3/10/166/10/16

Bibliographical note

Publisher Copyright:
© 2016 FMCAD Inc.

Fingerprint

Dive into the research topics of 'Lazy proofs for DPLL(T)-based SMT solvers'. Together they form a unique fingerprint.

Cite this