A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Proving Unrealizability for Syntax-Guided Synthesis
[chapter]
2019
Lecture Notes in Computer Science
We consider the problem of automatically establishing that a given syntax-guided-synthesis (SyGuS) problem is unrealizable (i.e., has no solution). Existing techniques have quite limited ability to establish unrealizability for general SyGuS instances in which the grammar describing the search space contains infinitely many programs. By encoding the synthesis problem's grammar G as a nondeterministic program PG, we reduce the unrealizability problem to a reachability problem such that, if a
doi:10.1007/978-3-030-25540-4_18
fatcat:h5owclerpvh27fhje5bi6rwq74