The deductive synthesis of imperative LISP programs

Authors:
Zohar Manna;Richard Waldinger
Affiliations:
Stanford University, Stanford, California;SRI International, Menlo Park, California
Venue:
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Year:
1987

Citing 5
Cited 0

How to clear a block: A theory of plans

Journal of Automated Reasoning
A Deductive Approach to Program Synthesis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Application of theorem proving to problem solving

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
PROW: a step toward automatic program writing

IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
The origin of the binary-search paradigm

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

A framework is described for the automatic synthesis of imperative programs, which may alter data structures and produce destructive side effects as part of their intended behavior. A program meeting a given specification is extracted from the proof of a theorem in a variant of situational logic, in which the states of a computation are explicit objects. As an example, an in-place reverse program has been derived in an imperative LISP, which includes assignment and destructive list operations (rplaca and rplacd).