A deductive approach to program synthesis

Authors:
Zohar Manna;Richard Waldinger
Affiliations:
Artificial Intelligence Laboratory, Stanford University;Artificial Intelligence Center, SRI International
Venue:
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Year:
1979

Citing 6
Cited 1

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Proving Theorems about LISP Functions

Journal of the ACM (JACM)
A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
A simplifier based on efficient decision algorithms

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence
Synthesis: Dreams ? Programs

IEEE Transactions on Software Engineering

Model-based diagnosis of planning failures

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.