Journal article
Refutation-based synthesis in SMT
Formal methods in system design, Vol.55(2), pp.73-102
12/2019
DOI: 10.1007/s10703-017-0270-2
Abstract
We introduce the first program synthesis engine implemented inside an SMT solver. We present an approach that extracts solution functions from unsatisfiability proofs of the negated form of synthesis conjectures. We also discuss novel counterexample-guided techniques for quantifier instantiation that we use to make finding such proofs practically feasible. A particularly important class of specifications are single-invocation properties, for which we present a dedicated algorithm. To support syntax restrictions on generated solutions, our approach can transform a solution found without restrictions into the desired syntactic form. As an alternative, we show how to use evaluation function axioms to embed syntactic restrictions into constraints over algebraic datatypes, and then use an algebraic datatype decision procedure to drive synthesis. Our experimental evaluation on syntax-guided synthesis benchmarks shows that our implementation in the CVC4 SMT solver is competitive with state-of-the-art tools for synthesis.
Details
- Title: Subtitle
- Refutation-based synthesis in SMT
- Creators
- Andrew ReynoldsViktor KuncakCesare TinelliClark BarrettMorgan Deters
- Resource Type
- Journal article
- Publication Details
- Formal methods in system design, Vol.55(2), pp.73-102
- DOI
- 10.1007/s10703-017-0270-2
- ISSN
- 0925-9856
- eISSN
- 1572-8102
- Grant note
- DOI: 10.13039/501100000781, name: European Research Council, award: 306484; DOI: 10.13039/501100001711, name: Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung, award: 200020_159949; DOI: 10.13039/100000083, name: Directorate for Computer and Information Science and Engineering, award: CNS 1228768
- Language
- English
- Date published
- 12/2019
- Academic Unit
- Computer Science
- Record Identifier
- 9984002304502771
Metrics
25 Record Views