Primitive recursive program transformation

Authors:
R. S. Boyer;J. S. Moore;R. E. Shostak
Affiliations:
-;-;-
Venue:
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Year:
1976

Citing 2
Cited 1

Proving Theorems about LISP Functions

Journal of the ACM (JACM)
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM

Derivation of Invariant Assertions During Program Development by Transformation

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe how to transform certain flowchart programs into equivalent explicit primitive recursive programs. The input/output correctness conditions for the transformed programs are more amenable to proof than the verification conditions for the corresponding flowchart programs. In particular, the transformed correctness conditions can often be verified automatically by the theorem prover developed by Boyer and Moore [1].