Automatic program synthesis from example problems

Authors:
L. Siklossy;D. A. Sykes
Affiliations:
Computer Sciences Department, University of Texas at Austin, Austin, Texas;Computer Sciences Department, University of Texas at Austin, Austin, Texas
Venue:
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Year:
1975

Citing 5
Cited 0

An improved program-synthesizing algorithm and its correctness

Communications of the ACM
Toward automatic program synthesis

Communications of the ACM
PROW: a step toward automatic program writing

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
An efficient robot planner which generates its own procedures

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Proving theorems about LISP functions

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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