Conference proceeding
Primitive recursive program transformation
Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on principles on programming languages, pp 171-174
01 Jan 1976
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].
Metrics
17 Record Views
2 citations in Scopus
Details
- Title
- Primitive recursive program transformation
- Creators
- R BoyerJ MooreR Shostak
- Publication Details
- Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on principles on programming languages, pp 171-174
- Series
- POPL '76
- Publisher
- ACM
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- [Retired Faculty]
- Scopus ID
- 2-s2.0-85032641401
- Other Identifier
- 991020638370704721