| dc.contributor.author | Singh, Rishabh | |
| dc.contributor.author | Solar-Lezama, Armando | |
| dc.date.accessioned | 2014-10-10T12:54:24Z | |
| dc.date.available | 2014-10-10T12:54:24Z | |
| dc.date.issued | 2012 | |
| dc.identifier.isbn | 978-3-642-31423-0 | |
| dc.identifier.isbn | 978-3-642-31424-7 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/90878 | |
| dc.description.abstract | We present Spt, a tool that helps programmers write low-level data-structure manipulations by combining various forms of insights such as abstract and concrete input-output examples as well as implementation skeletons. When programmers write such manipulations, they typically have a clear high-level intuition about how the manipulation should work, but implementing efficient low-level pointer manipulating code is error-prone. Our tool aims to bridge the gap between the intuition and the corresponding implementation by automatically synthesizing the implementation. The tool frames the synthesis problem as a generalization of an abstract-interpretation based shape analysis, and represents the problem as a set of constraints which are solved efficiently by the Sketch solver. We report the successful evaluation of our tool on synthesizing several linked list and binary search tree manipulations. | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant CCF-1116362) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Springer-Verlag | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-642-31424-7_58 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | MIT web domain | en_US |
| dc.title | SPT: Storyboard Programming Tool | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Singh, Rishabh, and Armando Solar-Lezama. “SPT: Storyboard Programming Tool.” Lecture Notes in Computer Science (2012): 738–743. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.mitauthor | Singh, Rishabh | en_US |
| dc.contributor.mitauthor | Solar Lezama, Armando | en_US |
| dc.relation.journal | Computer Aided Verification | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dspace.orderedauthors | Singh, Rishabh; Solar-Lezama, Armando | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0001-7604-8252 | |
| dspace.mitauthor.error | true | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |