23 citations · 68 across the 21 of their papers we have counts for
3 papers · 1 filter
An Instantiation-Based Approach for Solving Quantified Linear Arithmetic
Andrew Reynolds, Tim King, Viktor Kuncak
This paper presents a framework to derive instantiation-based decision procedures for satisfiability of quantified formulas in first-order theories, including its correctness, impl…
On Deciding Local Theory Extensions via E-matching
Kshitij Bansal, Andrew Reynolds, Tim King +2
Satisfiability Modulo Theories (SMT) solvers incorporate decision procedures for theories of data types that commonly occur in software. This makes them important tools for automat…
On Counterexample Guided Quantifier Instantiation for Synthesis in CVC4
Andrew Reynolds, Morgan Deters, Viktor Kuncak +2
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 negate…