A problem reduction approach to program synthesis

Authors:
Douglas R. Smith
Affiliations:
Department of Computer Science, Naval Postgraduate School, Monterey, CA
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Year:
1983

Citing 2
Cited 0

A Deductive Approach to Program Synthesis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Derived Preconditions and Their Use in Program Synthesis

Proceedings of the 6th Conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Program synthesis is the transformation of a specification of a user's problem into a computer program. A problem reduction approach to program synthesis is presented. During synthesis the user's problem is decomposed in a top-down manner into a hierarchy of subproblems. with directly solveable subproblems at the bottom. Solving these subproblems results in the bottom-up composition of a program whose structure reflects the subproblem hierarchy. The program is guaranteed to satisfy the specification and to terminate on all legal inputs. We illustrate this approach by presenting the knowledge needed to synthesize a class of divide and conquer algorithms and by deriving a Merge sort algorithm.