Work

Primitive recursive program transformation

Year: 1976

Type: conference-paper

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].

Source: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)

DOI: 10.1145/800168.811550

Authors: R. S. Boyer, J. S. Moore, R. E. Shostak

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W1989945455

FWCI:

Cites: 4

Cited by: 3

Related to: 10