Name
Abstract | ||
|---|---|---|
Writing heap manipulating programs is hard. Even though the high-level algorithms may be simple, it is often tedious to express them using low-level operations. We present a new tool - Synlip that uses expression of intent in the form of concrete examples drawn using box-and-arrow diagrams to synthesize heap-manipulations automatically. Instead of modeling the concrete examples in a monolithic manner, Synlip attempts to extract a set of patterns of manipulation that can be applied repeatedly to construct such programs. It, then, attempts to infer these patterns as linear transformations, leveraging the power of ILP solvers for program synthesis. In contrast to many current tools, Synlip does not need a bound on the number of statements and the number of temporaries to be used in the desired program. Also, it is almost insensitive to the size of the concrete examples and, thus, tends to be scalable. Synlip was found to be quite fast; it takes less than 10 seconds for most of our benchmark tasks spanning data-structures like singly and doubly linked-lists, AVL trees and binary search trees. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-662-48288-9_7 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Program synthesis,Computer science,Theoretical computer science,Heap (data structure),Integer programming,Linear map | Conference | 9291 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.37 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anshul Garg | 1 | 2 | 0.37 |
| Subhajit Roy | 2 | 45 | 10.84 |