Mon 24 Jun 2019 14:40 - 15:00 at 229AB - Synthesis Chair(s): Nuno P. Lopes

Many programs that interact with a database need to undergo schema refactoring several times during their life cycle. Since this process typically requires making significant changes to the program's implementation, schema refactoring is often non-trivial and error-prone. Motivated by this problem, we propose a new technique for automatically synthesizing a new version of a database program given its original version and the source and target schemas. Our method does not require manual user guidance and ensures that the synthesized program is equivalent to the original one. Furthermore, our method is quite efficient and can synthesize new versions of database programs (containing up to 263 functions) that are extracted from real-world web applications with an average synthesis time of 69.4 seconds.

Mon 24 Jun

pldi-2019-papers
14:00 - 15:30: PLDI Research Papers - Synthesis at 229AB
Chair(s): Nuno P. LopesMicrosoft Research
pldi-2019-papers14:00 - 14:20
Talk
Tristan KnothUniversity of California at San Diego, USA, Di WangCarnegie Mellon University, Nadia PolikarpovaUniversity of California, San Diego, Jan HoffmannCarnegie Mellon University
Media Attached
pldi-2019-papers14:20 - 14:40
Talk
Jiasi ShenMassachusetts Institute of Technology, Martin RinardMassachusetts Institute of Technology
DOI Media Attached
pldi-2019-papers14:40 - 15:00
Talk
Yuepeng WangUniversity of Texas at Austin, James DongUniversity of Texas at Austin, USA, Rushi ShahUT Austin, Isil DilligUT Austin
Media Attached
pldi-2019-papers15:00 - 15:20
Talk
Arun IyerMicrosoft Research, India, Manohar JonnalageddaInpher Inc., Switzerland, Suresh ParthasarathyMicrosoft Research, India, Arjun RadhakrishnaMicrosoft, Sriram RajamaniMicrosoft Research
Media Attached