Solar-Lezama, A., Rabbah, R., Bodik, R., Ebcioglu, K.: Programming by sketching for bit-streaming programs. Solar-Lezama, A.: Program Synthesis By Sketching. Singh, R., Solar-Lezama, A.: Synthesizing data structure manipulations from storyboards. Sagiv, M., Reps, T., Wilhelm, R.: Parametric shape analysis via 3-valued logic. Lev-Ami, T., Sagiv, M.: TVLA: A System for Implementing Static Analyses. Jobstmann, B., Griesmayer, A., Bloem, R.: Program Repair as a Game. This process is experimental and the keywords may be updated as the learning algorithm improves.

These keywords were added by machine and not by the authors. We report the successful evaluation of our tool on synthesizing several linked list and binary search tree manipulations.

The tool frames the synthesis problem as a generalization of an abstract-interpretation based shape analysis, and represents the problem as a set of constraints which are solved efficiently by the S ketch solver. Our tool aims to bridge the gap between the intuition and the corresponding implementation by automatically synthesizing the implementation. When programmers write such manipulations, they typically have a clear high-level intuition about how the manipulation should work, but implementing efficient low-level pointer manipulating code is error-prone. We present S pt, a tool that helps programmers write low-level data-structure manipulations by combining various forms of insights such as abstract and concrete input-output examples as well as implementation skeletons.

Download spt 1770 pdf