119 citations · 465 across the 38 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LO2015★ 23 cited
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…
cs.LO2015★ 3 cited
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…