A theoretical basis for stepwise refinement and the programming calculus

Science of Computer Programming - Tập 9 - Trang 287-306 - 1987
Joseph M. Morris1
1Department of Computer Science. University College Dublin, Belfield, Dublin 4, Ireland

Tài liệu tham khảo

Abrial, 1985, Programming as a mathematical exercise, 113 de Bakker, 1980 Birkhoff, 1961 Boom, 1982, A weaker precondition for loops, ACM TOPLAS, 4, 668, 10.1145/69622.357189 Dijkstra, 1976 Dijkstra, 1982, The equivalence of bounded nondeterminacy and continuity, 358 Gries, 1981 Hehner, 1984 Hehner, 1984, Predicative programming part 1, Comm. ACM, 27, 134, 10.1145/69610.357988 Hoare, 1985, Programs are predicates, 141 Hoare, 1985, Laws of programming: a tutorial paper Lassez, 1982, Fixed point theorems and semantics: a folk tale, Inform. Process. Lett., 14, 112, 10.1016/0020-0190(82)90065-5 Wirth, 1971, Program development by stepwise refinement, Comm. ACM, 14, 221, 10.1145/362575.362577