Types and invariants in the refinement calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 375 LNCS, Issue , 1989, Pages 363-378

  Morgan, Carroll ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

IMPERATIVE PROGRAMS; REFINEMENT CALCULI; TYPECHECKING;

CALCULATIONS;

EID: 2542635344     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51305-1_22     Document Type: Conference Paper

References (17)

1. R.-J. Back. Correctness preserving program refinements: Proof theory and applications. Tract 131, Mathematisch Centrum, Amsterdam, 1980.
2. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, 1976.
3. P.H.B. Gardiner and C.C. Morgan. Data refinement of predicate transformers. Accepted by Theoretical Computer Science. Reprinted in [11].
4. I.J. Hayes. Specification Case Studies. Prentice-Hall, London, 1987.
5. E.C.R. Hehner. The Logic of Programming. Prentice-Hall, London, 1984.
6. L. Lamport and F.B. Schneider. Constraints: a uniform approach to aliasing and typing. In 12th ACM Symposium on Principles of Programming Languages, pages 205–216, New Orleans, January 1985.
7. C.C. Morgan. Auxiliary variables in data refinement. Inf. Proc. Lett., 29(6):293–296, December 1988. Reprinted in [11].
8. C.C. Morgan. Data refinement using miracles. Inf. Proc. Lett., 26(5):243–246, January 1988. Reprinted in [11].
9. C. Morgan. The specification statement. Trans. Prog. Lang. Sys., 10(3), July 1988. Reprinted in [11].
10. C.C. Morgan and K.A. Robinson. Specification statements and refinement. IBM Jnl. Res. Dev., 31(5), September 1987. Reprinted in [11].
11. C.C. Morgan, K.A. Robinson, and P.H.B. Gardiner. On the refinement calculus. Technical Report PRG-70, Programming Research Group, 1988.
12. J.M. Morris. Laws of data refinement. Accepted by Acta Informatica.
13. J.M. Morris. A theoretical basis for stepwise refinement and the programming calculus. Science of Computer Programming, 9(3):298–306, December 1987.
14. G. Nelson. A generalization of Dijkstra's calculus. Technical Report 16, Digital Systems Research Center, April 1987.
15. J.C. Reynolds. The Craft of Programming. Prentice-Hall, London, 1981.
16. J.M. Spivey. The Z Notation: A Reference Manual. Prentice-Hall, London, 1989.
17. J.E. Stoy. Denotational Semantics: the Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977.