Author:
D’Antoni Loris,Hu Qinheping,Kim Jinwoo,Reps Thomas
Abstract
AbstractProgram synthesis is now a reality, and we are approaching the point where domain-specific synthesizers can now handle problems of practical sizes. Moreover, some of these tools are finding adoption in industry. However, for synthesis to become a mainstream technique adopted at large by programmers as well as by end-users, we need to design programmable synthesis frameworks that (i) are not tailored to specific domains or languages, (ii) enable one to specify synthesis problems with a variety of qualitative and quantitative objectives in mind, and (iii) come equipped with theoretical as well as practical guarantees. We report on our work on designing such frameworks and on building synthesis engines that can handle program-synthesis problems describable in such frameworks, and describe open challenges and opportunities.
Publisher
Springer International Publishing
Reference29 articles.
1. Alur, R., et al.: Syntax-guided synthesis. In: Formal Methods in Computer-Aided Design (FMCAD), pp. 1–8. IEEE (2013)
2. Lecture Notes in Computer Science;R Alur,2017
3. Amodio, M., Chaudhuri, S., Reps, T.W.: Neural attribute machines for program generation. CoRR, abs/1705.09231 (2017)
4. Barke, S., Peleg, H., Polikarpova, N.: Just-in-time learning for bottom-up enumerative synthesis. Proc. ACM Program. Lang. 4(OOPSLA,), 1–29 (2020)
5. Comon, H., et al.: Tree automata techniques and applications (2007). http://www.grappa.univ-lille3.fr/tata. Accessed 12 October 2007
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Case for Synthesis of Recursive Quantum Unitary Programs;Proceedings of the ACM on Programming Languages;2024-01-05
2. The SemGuS Toolkit;Lecture Notes in Computer Science;2024
3. Synthesis of Recursive Programs in Saturation;Lecture Notes in Computer Science;2024
4. Synthesizing axiomatizations using logic learning;Proceedings of the ACM on Programming Languages;2022-10-31