A Deductive Approach to Program Synthesis
Zohar Manna, Richard J. Waldinger · ACM Transactions on Programming Languages and Systems · 1980
Program synthesis is the systematic derivation of a program from a given specification. A deductive approach to program synthesis is presented for the construction of recursive programs. This approach regards program synthesis as a theorem-proving task and relies on a theorem-proving method that combines the features of transformation rules, unification, and mathematical induction within a single framework.
Cited by 573 works. doi:10.1145/357084.357090
Authors
References
- A Machine-Oriented Logic Based on the Resolution Principle
- Problem-Solving Methods in Artificial Intelligence
- Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub.
- Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot
- APPLICATION OF THEOREM PROVING TO PROBLEM SOLVING**This research is a part of Project Defender and was supported by the Advanced Research Projects Agency of the Department of Defense and was monitored by Rome Air Development Center under Contracts AF 30(602)-4147 and F30602-69-C-0056.††This preprint is a preliminary version and is subject to modification prior to publication.
- A Transformation System for Developing Recursive Programs
- PROW: a step toward automatic program writing
- Proving Theorems about LISP Functions
- Non-resolution theorem proving
- Synthesis: Dreams → Programs