Speeding up the Synthesis of Programs from Traces

IEEE Transactions on Computers

Volumn C-24, Issue 2, 1975, Pages 122-136

  Biermann, Alan W ^a   Baum, Richard I ^b   Petry, Frederick E ^b  

^a DUKE UNIVERSITY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

Computation trace; finite state machine synthesis; incompletely specified machines; inference; learning; program synthesis; program trace; tree searching

Indexed keywords

SYSTEMS SCIENCE AND CYBERNETICS - ARTIFICIAL INTELLIGENCE;

COMPUTER PROGRAMMING;

EID: 0016470289     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/T-C.1975.224180     Document Type: Article

References (32)

1. S. Amarel, “On the automatic formation of a computer program which represents a theory,” in Self Organizing Systems, Yovits, Jacobi, and Goldstein, Ed. New York: Spartan. 1962, pp. 107–175.
2. S. Amarel, “Representations and modelling in problems of program formation,” in Machine Intelligence, Meltzer and Michie, Ed. New York: American Elsevier, vol. 6, 1971, pp. 441–466.
3. D. D. Aufenkamp “Analysis of sequential machines, II,” IRE Trans. Electron. Comput., vol. EC-7, pp. 299–306, Dec. 1958.
4. D. D. Aufenkamp and F. E. Hohn “Analysis of sequential machines,” IRE Trans. Electron. Comput., vol. EC-6, pp. 276–285, Dec. 1957.
5. R. Balzer, “A global view of automatic programming,” in Proc. 3rd Int. Joint Conf. Artificial Intelligence, Stanford, Calif., Aug. 20–24, 1973, pp. 494–499.
6. J. Barzdin, “On synthesizing programs given by examples,” Computing Center, Latvian State Univ., Riga, USSR, 1972.
7. J. Barzdin and R. V. Freivald “On the prediction of general recursive functions,” Sov. Math. Dokl., vol. 13, no. 5, pp. 1224–1228, 1972.
8. L. Blum and M. Blum, “Inductive inference: A recursion theoretic approach,” Recursive Function Theory: Newsletter, no. 6, pp. 15–29, July 1973.
9. A. W. Biermann “On the inference of Turing machines from sample computations,” Artificial Intelligence, vol. 3, pp. 181–198, 1972.
10. A. W. Biermann, “An interactive finite-state language learner,” in Proc. USA-Japan Comput. Conf., Tokyo, Japan, Oct. 3–5, 1972, pp. 13–20.
11. A. W. Biermann, “Computer program synthesis from computation traces,” in Proc. Symp. Fundamental Theory of Programming, Kyoto University, Kyoto, Japan, Oct. 9–11, 1972, pp. 89–100.
12. A. W. Biermann, R. I. Baum, R. Krishnaswamy, and F. E. Petry, Autoprogrammer, Ten Minute Movie, Mar. 1974.
13. A. W. Biermann and J. A. Feldman, “A survey of results in grammatical inference,” in Frontiers in Pattern Recognition, Watanabe, Ed. New York: Academic, 1972, pp. 31–54.
14. A. W. Biermann and R. Krishnaswamy, “A system for program synthesis from examples,” in 1974 Proc. IEEE Syst., Man, and Cybernetics Conf., Dallas, Tex., Oct. 1974.
15. S. Crespi-Reghizzi, M. A. Melkanoff, and L. Lichten “The use of grammatical inference for designing programming languages,” Commun. Ass. Comput. Mach., vol. 16, pp. 83–90, Feb. 1973.
16. H. Enomoto, E. Tomita, and S. Doshita, “Synthesis of automata that recognize given strings and characterization of automata by representative,” in Proc. USA-Japan Comput. Conf., Tokyo, Japan, Oct. 3–5, 1972, pp. 21–27.
17. J. A. Feldman, “Automatic programming,” Dep. Comput. Sei., Stanford Univ., Stanford, Calif., Rep. 255, Feb. 1972.
18. J. A. Feldman “Some decidability results on grammatical inference and complexity,” Inform. Contr., vol. 20, pp. 244–262, Apr. 1972.
19. J. A. Feldman and P. C. Shields, “Total complexity and the inference of best programs,” Dep. Comput. Sci., Stanford Univ., Stanford, Calif., AIM-159, Apr. 1972.
20. A. Gill “Realization of input-output relations by sequential machines,” J. Ass. Comput. Mach., vol. 13, pp. 33–42, Jan. 1966.
21. S. Ginsburg “A technique for the reduction of a given machine to a minimal-state machine,” IRE Trans. Electron. Comput., vol. EC-8, pp. 346–355, Sept. 1959.
22. S. Ginsburg “Synthesis of minimal-state machines,” IRE Trans. Electron. Comput., vol. EC-8, pp. 441–449, Dec. 1959.
23. A. Grasselli and F. Luccio “A method for minimizing the number of internal states in incompletely specified sequential networks,” IEEE Trans. Electron. Comput., vol. EC-14, pp. 350–359, June 1965.
24. R. C. T. Lee and S. K. Chang, “Structured programming and automatic program synthesis,” in Proc. Symp. Very High Level Languages, Santa Monica, Calif., Mar. 28–29, 1974, pp. 60–70.
25. R. C. T. Lee, C. L. Chang, and R. Waldinger, “An improved program synthesizing algorithm and its correctness,” Commun. Ass. Comput. Mach., vol. 17, pp. 211–217, Apr. 1974.
26. Z. Manna and R. J. Waldinger “Toward automatic program synthesis,” Commun. Ass. Comput. Mach., vol. 14, pp. 151–164, Mar. 1971.
27. M. Minsky, Computation: Finite and Infinite Machines. Englewood Cliffs, N. J.: Prentice-Hall, 1967.
28. M. C. Paull and S. H. Unger “Minimizing the number of states in incompletely specified sequential switching functions,” IRE Trans. Electron. Comput., vol. EC-8, pp. 356–367, Sept. 1959.
29. P. Raulefs, “Automatic synthesis of minimal algorithms from samples of the behavior,” Institut fur Informatik, Universitat Karlsruhe, Germany, Rep. INFI-73-2, Jan. 1973.
30. H. A. Simon “Experiments with a heuristic compiler,” J. Ass. Comput. Mach., vol. 10, pp. 482–506, Oct. 1963.
31. A. A. Tal “Questionnaire language and abstract synthesis of minimum sequential machines,” Avtomatika i Telemekhanika, vol. 25, pp. 946–962, 1964.
32. R. J. Waldinger and R. C. T. Lee, “PROW: A step toward automatic program writing,” in Proc. 1st Int. Joint Conf. Artificial Intelligence, Washington, D. C., pp. 241–252, May 7–9, 1969.