Summary
A powerful method of simplifying the proofs of program correctness is suggested; and some new light is shed on the problem of functions with side-effects.
Similar content being viewed by others
References
Wirth, N.: The development of programs by stepwise refinement. Comm. ACM. 14, 221–227 (1971).
Dijkstra, E. W.: Notes on structured programming. In Structured Programming. Academic Press (1972).
Hoare, C. A. R.: Notes on data structuring. Ibid.
Dahl, O.-J.: Hierachical program structures. Ibid.
Milner, R.: An algebraic definition of simulation between programs. CS 205 Stanford University, February 1971.
Dijkstra, E. W.: A constructive approach to the problem of program correctness. BIT. 8, 174–186 (1968).
Dahl, O.-J., Myhrhaug, B., Nygaard, K.: The Simula 67 common base language. Norwegian Computing Center, Oslo, Publication No. S-22, 1970.
Hoare, C. A. R.: An axiomatic approach to computer programming. Comm. ACM. 12, 576–580, 583 (1969).
Author information
Authors and Affiliations
Additional information
I am deeply indebted to Doug Ross and to all authors of referenced works. Indeed, the material of this paper represents little more than my belated understanding and formalisation of their original work.
Rights and permissions
About this article
Cite this article
Hoare, C.A.R. Proof of correctness of data representations. Acta Informatica 1, 271–281 (1972). https://doi.org/10.1007/BF00289507
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289507