Experiments with a Heuristic Compiler
Journal of the ACM (JACM)
Realization of Input-Output Relations by Sequential Machines
Journal of the ACM (JACM)
An improved program-synthesizing algorithm and its correctness
Communications of the ACM
The use of grammatical inference for designing programming languages
Communications of the ACM
Toward automatic program synthesis
Communications of the ACM
Structured programming and automatic program synthesis
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Total complexity and the inference of best programs.
Total complexity and the inference of best programs.
Automatic programming.
Computation: finite and infinite machines
Computation: finite and infinite machines
PROW: a step toward automatic program writing
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
A global view of automatic programming
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Applications of exemplary programming
AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference
Inference of regular languages using state merging algorithms with search
Pattern Recognition
Dimensions in program synthesis
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
| Hi-index | 14.98 |
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.