Name
Abstract | ||
|---|---|---|
Syntax-guided synthesis searches for an implementation of a given specification by exploring large spaces of candidate programs. Sketches reduce these search spaces, making synthesis more tractable, by predefining the structure of the desired implementation. Typically, this structure is obtained through human insight---this paper introduces a method for interactive, tool-supported discovery of such structure. The key idea is to decompose the specification into subcomputations such that the decomposition dictates the sketch. We rely on a readily obtainable specification that is nothing more than a finite set of sample input-output pairs or execution traces of the desired program. We introduce two complementary decomposition operators and demonstrate them on case studies. We find that our interactive methodology to discover structure extends the reach of computer-aided programming to problems that cannot be solved with synthesis alone. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2814228.2814235 | Onward! |
Field | DocType | Citations |
Finite set,Programming language,Nothing,Computer science,Theoretical computer science,Relational algebra,Operator (computer programming),Sketch | Conference | 3 |
PageRank | References | Authors |
0.38 | 22 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shaon Barman | 1 | 51 | 2.72 |
| Rastislav Bodík | 2 | 1625 | 101.21 |
| Satish Chandra | 3 | 1170 | 86.45 |
| Emina Torlak | 4 | 606 | 30.70 |
| Arka A. Bhattacharya | 5 | 394 | 19.81 |
| David Culler | 6 | 23468 | 2674.49 |