Hoare, C. A. R. Proof of correctness of data representations. (English) Zbl 0244.68009 Acta Inf. 1, 271-281 (1972). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 107 Documents MSC: 68N01 General topics in the theory of software Software:Simula 67 PDFBibTeX XMLCite \textit{C. A. R. Hoare}, Acta Inf. 1, 271--281 (1972; Zbl 0244.68009) Full Text: DOI References: [1] Wirth, N.: The development of programs by stepwise refinement. Comm. ACM. 14, 221-227 (1971). · Zbl 0214.43005 [2] Dijkstra, E. W.: Notes on structured programming. In Structured Programming. Academic Press (1972). · Zbl 0267.68001 [3] Hoare, C. A. R.: Notes on data structuring. Ibid. [4] Dahl, O.-J.: Hierachical program structures. Ibid. [5] Milner, R.: An algebraic definition of simulation between programs. CS 205 Stanford University, February 1971. [6] Dijkstra, E. W.: A constructive approach to the problem of program correctness. BIT. 8, 174-186 (1968). · Zbl 0167.46002 [7] Dahl, O.-J., Myhrhaug, B., Nygaard, K.: The Simula 67 common base language. Norwegian Computing Center, Oslo, Publication No. S-22, 1970. [8] Hoare, C. A. R.: An axiomatic approach to computer programming. Comm. ACM. 12, 576-580, 583 (1969). · Zbl 0179.23105 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.