2000 character limit reached
Approaches for Synthesis Conjectures in an SMT Solver (1411.3970v2)
Published 14 Nov 2014 in cs.LO and cs.PL
Abstract: 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.