Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-642-54013-4_22 | VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION: (VMCAI 2014) |
Field | DocType | Volume |
Program synthesis,Computer science,Theoretical computer science,Modular reasoning,Function model,Counterexample,Modular design,Source lines of code,Sketch | Conference | 8318 |
ISSN | Citations | PageRank |
0302-9743 | 3 | 0.38 |
References | Authors | |
7 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rohit Singh | 1 | 570 | 21.99 |
| Rishabh Singh | 2 | 684 | 48.19 |
| Zhilei Xu | 3 | 187 | 10.42 |
| Rebecca Krosnick | 4 | 4 | 1.74 |
| Armando Solar-Lezama | 5 | 791 | 59.48 |