Program correctness methods and language definition

Authors:
E. A. Ashcroft
Affiliations:
University of Waterloo, Waterloo, Ontario, Canada
Venue:
Proceedings of ACM conference on Proving assertions about programs
Year:
1972

Citing 2
Cited 1

Formalization of Properties of Functional Programs

Journal of the ACM (JACM)
Correspondence between ALGOL 60 and Church's Lambda-notation: part I

Communications of the ACM

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

The development of the method of proving correctness of programs is considered in relation to methods of defining programming languages. Informal methods are given for checking proposed adaptations of the correctness method to new programming languages. It is shown how correctness-formulae can be considered as semantic definitions of programs, and how Burstall's logical language definitions can be considered as correctness formulae.