review-article

Free access

Search-based program synthesis

Authors:

Rajeev Alur,

Rishabh Singh,

Dana Fisman,

Armando Solar-LezamaAuthors Info & Claims

Communications of the ACM, Volume 61, Issue 12

Pages 84 - 93

https://doi.org/10.1145/3208071

Published: 20 November 2018 Publication History

All formats PDF

Abstract

A promising, useful tool for future programming development environments.

References

[1]

Akiba, T., Imajo, K., Iwami, H., Iwata, Y., Kataoka, T., Takahashi, N., Mmoskal, M., Swamy, N. Calibrating research in program synthesis using 72,000 hours of programmer time. Technical Report, MSR, 2013.

Google Scholar

[2]

Alur, R., Bodík, R., Juniwal, G., Martin, M.M.K., Raghothaman, M., Seshia, S.A., Singh, R., Solar-Lezama, A., Torlak, E., Udupa, A. Syntax-guided synthesis. In Proc. FMCAD, 2013, 1--17.

Google Scholar

[3]

Alur, R., Radhakrishna, A., Udupa, A. Scaling enumerative program synthesis via divide and conquer. In Proc. TACAS, LNCS 10205, 2017, 319--336.

Google Scholar

[4]

Clarke, E., Grumberg, O., Peled, D. Model Checking. MIT Press, 2000.

Google Scholar

[5]

de Moura, L., Bjørner, N. Satisfiability Modulo Theories: Introduction and applications. Commun. ACM 54, 9 (2011), 69--77.

Digital Library

Google Scholar

[6]

Devlin, J., Uesato, J., Bhupatiraju, S., Singh, R., Mohamed, A., Kohli, P. Robustfill: Neural program learning under noisy I/O. In Proc. ICML, 2017, 990--998.

Google Scholar

[7]

Eldib, H., Wu, M., Wang, C. Synthesis of fault-attack countermeasures for cryptographic circuits. In Proc. CAV, LNCS 9780, 2016, 343--363.

Google Scholar

[8]

Garg, P., Löding, C., Madhusudan, P., Neider, D. ICE: A robust framework for learning invariants. In Proc. CAV, LNCS 8559, 2014, 69--87.

Digital Library

Google Scholar

[9]

Ghalaty, N., Aysu, A., Schaumont, P. Analyzing and eliminating the causes of fault sensitivity analysis. In Proc. DATE, 2014, 1--6.

Digital Library

Google Scholar

[10]

Gulwani, S. Automating string processing in spreadsheets using input--output examples. In Proc. POPL, 2011, 317--330.

Digital Library

Google Scholar

[11]

Gulwani, S., Harris, W.R., Singh, R. Spreadsheet data manipulation using examples. Commun. ACM, 55, 8 (2012), 97--105.

Digital Library

Google Scholar

[12]

Gulwani, S., Jha, S., Tiwari, A., Venkatesan, R. Synthesis of loop-free programs. In Proc. PLDI, 2011, 62--73.

Digital Library

Google Scholar

[13]

Jha, S., Gulwani, S., Seshia, S.A., Tiwari, A. Oracle-guided component-based program synthesis. In Proc. ICSE, 2010, 215--224.

Digital Library

Google Scholar

[14]

Kuncak, V., Mayer, M., Piskac, R., Suter, P. Software synthesis procedures. Commun. ACM, 55, 2.

Digital Library

Google Scholar

[15]

Le, X.D., Chu, D., Lo, D., Le Goues, C., Visser, W. S3: Syntax- and semantic-guided repair synthesis via programming by examples. In Proc. FSE, 2017, 593--604.

Digital Library

Google Scholar

[16]

Malik, S., Zhang, L. Boolean satisfiability: From theoretical hardness to practical success. Commun. ACM, 52, 8 (2009), 76--82.

Digital Library

Google Scholar

[17]

Manna, Z., Waldinger, R. Fundamentals of deductive program synthesis. IEEE Trans. Softw. Eng. 18, 8 (1992), 674--704.

Digital Library

Google Scholar

[18]

Massalin, H. Superoptimizer -- A look at the smallest program. In Proc. ASPLOS, 1987, 122--126.

Crossref

Google Scholar

[19]

Mechtaev, S., Yi, J., Roychoudhury, A. Angelix: Scalable multiline program patch synthesis via symbolic analysis. In Proc. ICSE, 2016, 691--701.

Digital Library

Google Scholar

[20]

Mitchell, T. Machine Learning. McGraw-Hill, 1997.

Digital Library

Google Scholar

[21]

Osera, P., Zdancewic, S. Type-and-example-directed program synthesis. In Proc. PLDI, 2015, 619--630.

Digital Library

Google Scholar

[22]

Polikarpova, N., Kuraj, I., Solar-Lezama, A. Program synthesis from polymorphic refinement types. In Proc. PLDI, 2016, 522--538.

Digital Library

Google Scholar

[23]

Quinlan, J. Introduction to decision trees. Mach. Learn. 1, 1 (1986), 81--106.

Digital Library

Google Scholar

[24]

Raychev, V., Vechev, M.T., Yahav, E. Code completion with statistical language models. In Proc. PLDI, 2014, 419--428.

Digital Library

Google Scholar

[25]

Reynolds, A., Deters, M., Kuncak, V., Tinelli, C., Barrett, C.W. Counterexample-guided quantifier instantiation for synthesis in SMT. In Proc. CAV, 2015, 198--216.

Google Scholar

[26]

Schkufza, E., Sharma, R., Aiken, A. Stochastic program optimization. Commun. ACM 59, 2 (2016), 114--122.

Digital Library

Google Scholar

[27]

Seshia, S.A. Combining induction, deduction, and structure for verification and synthesis. Proc. IEEE 103, 11 (2015), 2036--2051.

Crossref

Google Scholar

[28]

Solar-Lezama, A. Program sketching. STTT 15, 5--6 (2013), 475--495.

Digital Library

Google Scholar

[29]

Solar-Lezama, A., Rabbah, R., Bodík, R., Ebcioglu, K. Programming by sketching for bit-streaming programs. In Proc. PLDI, 2005, 281--294.

Digital Library

Google Scholar

[30]

Srivastava, S., Gulwani, S., Foster, J.S. Template-based program verification and program synthesis. STTT 15, 5--6 (2013), 497--518.

Digital Library

Google Scholar

[31]

Stump, A., Sutcliffe, G., Tinelli, C. Starexec: A cross-community infrastructure for logic solving. In Proc. IJCAR, 2014, 367--373.

Google Scholar

[32]

Udupa, A., Raghavan, A., Deshmukh, J., Mador-Haim, S., Martin, M., Alur, R. TRANSIT: Specifying protocols with concolic snippets. In Proc. PLDI, 2013, 287--296.

Digital Library

Google Scholar

[33]

Warren, H.S. Hacker's Delight. Addison-Wesley, 2002.

Digital Library

Google Scholar

Cited By

View all

Zhang ZSun YJi RLi SPeng XHuang ZLi SZhu TXiong Yd'Amorim M(2024)ASAC: A Benchmark for Algorithm SynthesisCompanion Proceedings of the 32nd ACM International Conference on the Foundations of Software Engineering10.1145/3663529.3663802(577-581)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1145/3663529.3663802
Jeon MPark JOh H(2024)PL4XGL: A Programming Language Approach to Explainable Graph LearningProceedings of the ACM on Programming Languages10.1145/36564648:PLDI(2148-2173)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656464
Nazari AChattopadhyay SSwayamdipta SRaghothaman MRoychoudhury APaiva AAbreu RStorey M(2024)NomNom: Explanatory Function Names for Program SynthesizersProceedings of the 2024 IEEE/ACM 46th International Conference on Software Engineering: Companion Proceedings10.1145/3639478.3643529(418-419)Online publication date: 14-Apr-2024
https://dl.acm.org/doi/10.1145/3639478.3643529
Show More Cited By

Index Terms

Search-based program synthesis

Recommendations

Accelerating search-based program synthesis using learned probabilistic models
PLDI '18

A key challenge in program synthesis concerns how to efficiently search for the desired program in the space of possible programs. We propose a general approach to accelerate search-based program synthesis by biasing the search towards likely programs. ...
From program verification to program synthesis
POPL '10: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier by allowing programs to be specified at a higher-level than executable ...
From program verification to program synthesis
POPL '10

This paper describes a novel technique for the synthesis of imperative programs. Automated program synthesis has the potential to make programming and the design of systems easier by allowing programs to be specified at a higher-level than executable ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 61, Issue 12

December 2018

104 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/3293542

Editor:
Andrew A. Chien
Association for Computing Machinery, New York, NY

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 November 2018

Published in CACM Volume 61, Issue 12

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Review-article
Popular
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

52
Total Citations
View Citations
3,026
Total Downloads

Downloads (Last 12 months)576
Downloads (Last 6 weeks)58

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhang ZSun YJi RLi SPeng XHuang ZLi SZhu TXiong Yd'Amorim M(2024)ASAC: A Benchmark for Algorithm SynthesisCompanion Proceedings of the 32nd ACM International Conference on the Foundations of Software Engineering10.1145/3663529.3663802(577-581)Online publication date: 10-Jul-2024
https://dl.acm.org/doi/10.1145/3663529.3663802
Jeon MPark JOh H(2024)PL4XGL: A Programming Language Approach to Explainable Graph LearningProceedings of the ACM on Programming Languages10.1145/36564648:PLDI(2148-2173)Online publication date: 20-Jun-2024
https://dl.acm.org/doi/10.1145/3656464
Nazari AChattopadhyay SSwayamdipta SRaghothaman MRoychoudhury APaiva AAbreu RStorey M(2024)NomNom: Explanatory Function Names for Program SynthesizersProceedings of the 2024 IEEE/ACM 46th International Conference on Software Engineering: Companion Proceedings10.1145/3639478.3643529(418-419)Online publication date: 14-Apr-2024
https://dl.acm.org/doi/10.1145/3639478.3643529
Ding YQiu X(2024)Enhanced Enumeration Techniques for Syntax-Guided Synthesis of Bit-Vector ManipulationsProceedings of the ACM on Programming Languages10.1145/36329138:POPL(2129-2159)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632913
Deng HTao RPeng YWu X(2024)A Case for Synthesis of Recursive Quantum Unitary ProgramsProceedings of the ACM on Programming Languages10.1145/36329018:POPL(1759-1788)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632901
Segovia-Aguas JJiménez SJonsson A(2024)Generalized planning as heuristic search: A new planning search-space that leverages pointers over objectsArtificial Intelligence10.1016/j.artint.2024.104097330(104097)Online publication date: May-2024
https://doi.org/10.1016/j.artint.2024.104097
Miltner ALoehr DMong AFisher KWalker D(2023)Saggitarius: A DSL for Specifying Grammatical DomainsProceedings of the ACM on Programming Languages10.1145/36228697:OOPSLA2(2023-2051)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622869
Sun YPeng XXiong Y(2023)Synthesizing Efficient Memoization AlgorithmsProceedings of the ACM on Programming Languages10.1145/36228007:OOPSLA2(89-115)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622800
Hirzel M(2023)Low-Code Programming ModelsCommunications of the ACM10.1145/358769166:10(76-85)Online publication date: 22-Sep-2023
https://dl.acm.org/doi/10.1145/3587691
Goharshady AHitarth SMohammadi FMotwani H(2023)Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial ProgramsProceedings of the ACM on Programming Languages10.1145/35860527:OOPSLA1(727-756)Online publication date: 6-Apr-2023
https://dl.acm.org/doi/10.1145/3586052
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Digital Edition

View this article in digital edition.

Digital Edition

Magazine Site

View this article on the magazine site (external)

Magazine Site

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Accelerating search-based program synthesis using learned probabilistic models

From program verification to program synthesis

From program verification to program synthesis

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Digital Edition

Magazine Site

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations