Modular Synthesis of Sketches Using Models
Name
Solar-Lezama_Modular synthesis.pdf
Size
1.05 MB
Format
Adobe PDF
Checksum (MD5)
244a4bf19e7ea979ba458f857b1ee747
Author(s)
Singh, Rohit
Singh, Rishabh
Xu, Zhilei
Krosnick, Rebecca P.
Solar-Lezama, Armando
Date Issued
2014
Journal
Verification, Model Checking, and Abstract Interpretation
Publisher
Springer-Verlag
Citation
Singh, Rohit et al. “Modular Synthesis of Sketches Using Models.” Verification, Model Checking, and Abstract Interpretation. Ed. Kenneth L. McMillan and Xavier Rival. Vol. 8318. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. 395–414.
Version
Author's final manuscript
Abstract
One problem with the constraint-based approaches to synthesis that have become popular over the last few years is that they only scale to relatively small routines, on the order of a few dozen lines of code. This paper presents a mechanism for modular reasoning that allows us to break larger synthesis problems into small manageable pieces. The approach builds on previous work in the verification community of using high-level specifications and partially interpreted functions (we call them models) in place of more complex pieces of code in order to make the analysis modular.
The main contribution of this paper is to show how to combine these techniques with the counterexample guided synthesis approaches used to efficiently solve synthesis problems. Specifically, we show two new algorithms; one to efficiently synthesize functions that use models, and another one to synthesize functions while ensuring that the behavior of the resulting function will be in the set of behaviors allowed by the model. We have implemented our approach on top of the open-source Sketch synthesis system, and we demonstrate its effectiveness on several Sketch benchmark problems.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-54013-4_22
