
Proving Unrealizability for SyntaxGuided Synthesis
Proving Unrealizability for SyntaxGuided Synthesis We consider the pr...
read it

SemanticsGuided Synthesis
This paper develops a new framework for program synthesis, called semant...
read it

Reconciling Enumerative and Symbolic Search in SyntaxGuided Synthesis
Syntaxguided synthesis aims to find a program satisfying semantic speci...
read it

JustinTime Learning for BottomUp Enumerative Synthesis
A key challenge in program synthesis is the astronomical size of the sea...
read it

Solving Homotopy Domain Equations
In order to get λmodels with a rich structure of ∞groupoid, which we c...
read it

Overfitting in Synthesis: Theory and Practice (Extender Version)
In syntaxguided synthesis (SyGuS), a synthesizer's goal is to automatic...
read it

EqFix: Fixing LaTeX Equation Errors by Examples
LaTeX is a widelyused document preparation system. Its powerful ability...
read it
Exact and Approximate Methods for Proving Unrealizability of SyntaxGuided Synthesis Problems
We consider the problem of automatically establishing that a given syntaxguidedsynthesis (SyGuS) problem is unrealizable (i.e., has no solution). We formulate the problem of proving that a SyGuS problem is unrealizable over a finite set of examples as one of solving a set of equations: the solution yields an overapproximation of the set of possible outputs that any term in the search space can produce on the given examples. If none of the possible outputs agrees with all of the examples, our technique has proven that the given SyGuS problem is unrealizable. We then present an algorithm for exactly solving the set of equations that result from SyGuS problems over linear integer arithmetic (LIA) and LIA with conditionals (CLIA), thereby showing that LIA and CLIA SyGuS problems over finitely many examples are decidable. We implement the proposed technique and algorithms in a tool called Nay. Nay can prove unrealizability for 70/132 existing SyGuS benchmarks, with running times comparable to those of the stateoftheart tool Nope. Moreover, Nay can solve 11 benchmarks that Nope cannot solve.
READ FULL TEXT
Comments
There are no comments yet.