Programmable Program Synthesis
May 18, 2021 at 12:00pm
Program 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.
Loris D’Antoni is an Assistant Professor in the Department of Computer Sciences at the University of Wisconsin-Madison. There, he’s affiliated with the madPL (Madison Programming Languages) Group. His research is centered on building fundamental verification and synthesis techniques that help programmers write software that meets their intent. In particular, he’s currently focused on building practical and predictable program synthesis techniques that can be applied to computer networks, program repair, and machine learning. He has won an NSF CAREER Award, the Microsoft Research Faculty Fellowship, Google and Facebook Faculty Awards, and the Morris and Dorothy Rubinoff Dissertation Award. His papers were selected for special journal issues (TOPLAS, FMSD) and nominated for best paper awards (TACAS, ESOP). Loris received his Bachelor and Masters in Computer Science from the University of Torino in 2008 and 2010, respectively, and his PhD in Computer Science from the University of Pennsylvania in 2015.