Derivation of axiomatic definitions of programming languages from algorithmic definitions

Authors:
C David Allen
Affiliations:
Programming Technology Department, IBM Product Test Laboratory, Hursley England
Venue:
Proceedings of ACM conference on Proving assertions about programs
Year:
1972

Citing 2
Cited 1

An axiomatic basis for computer programming

Communications of the ACM
Termination of algorithms

Termination of algorithms

A summary of progress toward proving program correctness

AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Language definitions by abstract interpreters are appropriate to the design and development of a language. Axiomatic definitions are more appropriate to proving program properties and verification of compilers. The proof methods of Manna and Ashcroft can be applied to an algorithmic definition in, e.g. the Vienna Definition Language to deduce theorems which constitute an axiomatic definition of precisely the same language. The process and techniques are explained, and illustrated on a simple language of assignment statements.