论文信息 - Automatic Program Synthesis from Example Problems

Automatic Program Synthesis from Example Problems

Desired algorithms to be synthesized are described implicitly by example problems that the algorithms should solve. The example problems are first solved by the problem-solver LAWALY. The obtained solution represents a trace of the desired algorithm. From the trace, the algorithm is synthesized by the synthesizer SYN. SYN writes recursive programs with repeat statements, and generates its own subroutines. Examples of functions synthesized include repetitive robot tasks and tree traversal algorithms

Laurent Siklóssy | D. A. Sykas

[1] Richard C. T. Lee,et al. An improved program-synthesizing algorithm and its correctness , 1974, CACM.

[2] Zohar Manna,et al. Toward automatic program synthesis , 1971, Symposium on Semantics of Algorithmic Languages.

[3] Richard C. T. Lee,et al. PROW: A Step Toward Automatic Program Writing , 1969, IJCAI.

[4] John W. Roach,et al. Collaborative Problem-Solving Between Optimistic and Pessimistic Problem Solvers , 1974, IFIP Congress.

[5] Robert A. Kowalski,et al. Predicate Logic as Programming Language , 1974, IFIP Congress.

[6] L. Siklóssy,et al. Procedural Learning in Worlds of Robots , 1976 .

[7] A. W. Biermann. Automatic Program Synthesis Reports. , 1973 .

[8] John W. Roach,et al. Collaborative Problem-solving Between Optimistic and Pessimistic ProblemSolvers , 1973 .

[9] Laurent Siklóssy,et al. An Efficient Robot Planner which Generates Its Own Procedures , 1973, IJCAI.

[10] Robert S. Boyer,et al. Proving Theorems about LISP Functions , 1973, JACM.

[11] David C. Luckham,et al. On automating the construction of programs. , 1974 .

[12] John W. Roach,et al. Model Verification and Improvement Using DISPROVER , 1975, Artif. Intell..

[13] David R. Barstow,et al. Progress report on program-understanding systems. , 1974 .

[14] Alan W. Biermann,et al. On the Inference of Turing Machines from Sample Computations , 1972, Artif. Intell..