Advanced Search
DSpace@MIT

Program synthesis from polymorphic refinement types

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Polikarpova, Nadezhda
dc.contributor.author Kuraj, Ivan
dc.contributor.author Solar Lezama, Armando
dc.date.accessioned 2017-12-29T20:34:47Z
dc.date.available 2017-12-29T20:34:47Z
dc.date.issued 2016-06
dc.identifier.isbn 978-1-4503-4261-2
dc.identifier.uri http://hdl.handle.net/1721.1/112997
dc.description.abstract We present a method for synthesizing recursive functions that provably satisfy a given specification in the form of a polymorphic refinement type. We observe that such specifications are particularly suitable for program synthesis for two reasons. First, they offer a unique combination of expressive power and decidability, which enables automatic verification—and hence synthesis—of nontrivial programs. Second, a type-based specification for a program can often be effectively decomposed into independent specifications for its components, causing the synthesizer to consider fewer component combinations and leading to a combinatorial reduction in the size of the search space. At the core of our synthesis procedure is a newalgorithm for refinement type checking, which supports specification decomposition. We have evaluated our prototype implementation on a large set of synthesis problems and found that it exceeds the state of the art in terms of both scalability and usability. The tool was able to synthesize more complex programs than those reported in prior work (several sorting algorithms and operations on balanced search trees), as well as most of the benchmarks tackled by existing synthesizers, often starting from a more concise and intuitive user input. en_US
dc.description.sponsorship National Science Foundation (U.S.) (Grant CCF-1438969) en_US
dc.description.sponsorship National Science Foundation (U.S.) (Grant CCF-1139056) en_US
dc.description.sponsorship United States. Defense Advanced Research Projects Agency (Grant FA8750-14-2-0242) en_US
dc.language.iso en_US
dc.publisher Association for Computing Machinery en_US
dc.relation.isversionof http://dx.doi.org/10.1145/2908080.2908093 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 arXiv en_US
dc.title Program synthesis from polymorphic refinement types en_US
dc.type Article en_US
dc.identifier.citation Polikarpova, Nadia, Ivan Kuraj, and Armando Solar-Lezama. "Program Synthesis from Polymorphic Refinement Types." Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation PLDI '16, 13-17 June, 2016, Santa Barbara, CA, ACM Press, 2016, pp. 522–38. 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 Polikarpova, Nadezhda
dc.contributor.mitauthor Kuraj, Ivan
dc.contributor.mitauthor Solar Lezama, Armando
dc.relation.journal Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2016 en_US
dc.identifier.mitlicense OPEN_ACCESS_POLICY en_US
dc.eprint.version Original 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 Polikarpova, Nadia; Kuraj, Ivan; Solar-Lezama, Armando en_US
dspace.embargo.terms N en_US
dc.identifier.orcid https://orcid.org/0000-0001-5571-173X
dc.identifier.orcid https://orcid.org/0000-0001-5891-0208
dc.identifier.orcid https://orcid.org/0000-0001-7604-8252


Files in this item

Name Size Format
Downloadable Full Text - PDF

This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution-Noncommercial-Share Alike Except where otherwise noted, this item's license is described as Creative Commons Attribution-Noncommercial-Share Alike
Open Access