DocumentCode :
1117484
Title :
Speeding up the Synthesis of Programs from Traces
Author :
Biermann, Alan W. ; Baum, Richard I. ; Petry, Frederick E.
Author_Institution :
Department of Computer Science, Duke University
Issue :
2
fYear :
1975
Firstpage :
122
Lastpage :
136
Abstract :
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.
Keywords :
Computation trace, finite-state machine synthesis, incompletely specified machines, inference, learning, program synthesis, program trace, tree searching.; Computer science; Decision trees; Education; Humans; Information science; Machine learning; Man machine systems; Synthesizers; Testing; Vehicles; Computation trace, finite-state machine synthesis, incompletely specified machines, inference, learning, program synthesis, program trace, tree searching.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1975.224180
Filename :
1672773
Link To Document :
بازگشت