Speeding up the Synthesis of Programs from Traces
Alan W. Biermann, Richard I. Baum, Frederick E. Petry · IEEE Transactions on Computers · 1975
An algorithm is given for synthesizing a computer program from a trace of its behavior. Since the algorithm involves a search, the length of time required to do the synthesis of nontrivial programs can be quite large. Techniques are given for preprocessing the trace information to reduce enumeration, for pruning the search using a failure memory technique, and for utilizing multiple traces to the best advantage. The results of numerous tests are given to demonstrate the value of the techniques.