Toward automatic program synthesis

Abstract

An elementary outline of the theorem-proving approach to automatic program synthesis is given, without dwelling on technical details. The method is illustrated hy the automatic eonstruetion of both recursive and iterative programs operating on natural numbers, lists, and trees.In order to construct a program satisfying certain specifications, a theorem induced hy those specifications is proved, and the desired program is extracted from the proof. The same technique is applied to transform recursively defined functions into iterative programs, frequently with a major gain in efficiency.It is emphasized that in order to construct a program with loops or with recursion, the principle of mathematical induction must be applied. The relation between the version of the induetion rule used and the form of the program eonstrueted is explored in some detail.

Knowledge and reasoning in program synthesis

“…Manna and Waldinger [1971] This step may require that we actually modify portions of the program f that have already been synthesized in order to satisfy the new specification P. The recursive call to the modified program will then be sure to satisfy P(f(a)). This process will be illustrated in more detail during the synthesis of the pattern marcher in Part III.…”

Reductions for Synthesis Procedures

“…It has received increased attention recently, but has been studied for decades [3,11,12,16]. Our paper pursues the synthesis of functions mapping inputs to outputs.…”

Comfusy: A Tool for Complete Functional Synthesis

“…Synthesis is among the most ambitious techniques for building correct computer systems [4]. Recently, we have seen advances of synthesis for finite-state reactive systems [6,1].…”