This report describes several approaches for handling synthesis conjectures within an Satisfiability Modulo Theories (SMT) solver. We describe approaches that primarily focus on determining the unsatisfiability of the negated form of synthesis conjectures using new techniques for quantifier instantiation.
Cite
@article{arxiv.1411.3970,
title = {Approaches for Synthesis Conjectures in an SMT Solver},
author = {Andrew Reynolds},
journal= {arXiv preprint arXiv:1411.3970},
year = {2015}
}