Proof of Correctness of Data Representations

作者: C. A. R. Hoare

DOI: 10.1007/978-3-642-59412-0_24

关键词: Abstract spacePrimitive operationProgram analysisExternal Data RepresentationCorrectnessMathematicsAbstract programCalculusTheoretical computer scienceMathematical proof

摘要: A powerful method of simplifying the proofs program correctness is suggested; and some new light shed on problem functions with side-effects.

参考文章(9)
Edsger Wybe Dijkstra, Notes on structured programming In Structured programming (1972), pp. 1-82. ,vol. 8, pp. 1- 82 ,(1970)
E. W. Dijkstra, A constructive approach to the problem of program correctness Bit Numerical Mathematics. ,vol. 8, pp. 174- 186 ,(1968) , 10.1007/BF01933419
Charles Antony Richard Hoare, Notes on Data Structuring ,(1972)
C. A. R. Hoare, An axiomatic basis for computer programming Communications of the ACM. ,vol. 26, pp. 53- 56 ,(1983) , 10.1145/357980.358001
Niklaus Wirth, Program development by stepwise refinement Communications of the ACM. ,vol. 26, pp. 70- 74 ,(1983) , 10.1145/357980.358010
Robin Milner, An algebraic definition of simulation between programs international joint conference on artificial intelligence. pp. 481- 489 ,(1971)
Tony Hoare, An Axiomatic Basis for Computer Programming Communications of The ACM. ,vol. 12, ,(1969)
Niklaus Wirth, Program development by stepwise refinement Communications of the ACM. ,vol. 14, pp. 221- 227 ,(1971) , 10.1145/362575.362577