A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Program Synthesis as Dependency Quantified Formula Modulo Theory
2021
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence
unpublished
Given a specification φ(X, Y ) over inputs X and output Y and defined over a background theory T, the problem of program synthesis is to design a program f such that Y = f (X), satisfies the specification φ. Over the past decade, syntax-guided synthesis (SyGuS) has emerged as a dominant approach to program synthesis where in addition to the specification φ, the end-user also specifies a grammar L to aid the underlying synthesis engine. This paper investigates the feasibility of synthesis
doi:10.24963/ijcai.2021/261
fatcat:gmouqyvlunfupfjkewudtaagai