Formal Aspects of Computing

, Volume 24, Issue 4–6, pp 417–422 | Cite as


  • P. Höfner


  1. ASM80.
    Abrial J-R, Schuman SA, Meyer B (1980) A specification language. In: On the construction of programs. Cambridge University Press, Cambridge, pp 343–410Google Scholar
  2. Bac78.
    Back R-J (1978) On the correctness of refinement steps in program development. PhD thesis. Report A-1978-4, Department of Computer Science, University of HelsinkiGoogle Scholar
  3. BdM96.
    Bird R, de Moor O (1996) The algebra of programming. Prentice-Hall, Englewood CliffsGoogle Scholar
  4. Bro93.
    Broy M (ed) (1993) Program design calculi. In: NATO ASI series, series F: computer and system sciences, vol 118. Springer, BerlinGoogle Scholar
  5. [BvW98]
    Back R-J, von Wright J (1998) Refinement calculus: a systematic introduction. In: Graduate texts in computer science. Springer, BerlinGoogle Scholar
  6. [DvGH+07]
    Deng Y, van Glabbeek RJ, Hennessy M, Morgan CC, Zhang C (2007) Remarks on testing probabilistic processes. Electron Notes Theor Comput Sci 172: 359–397CrossRefGoogle Scholar
  7. [DvGHM08]
    Deng Y, van Glabbeek RJ, Hennessy M, Morgan CC (2008) Characterising testing preorders for finite probabilistic processes. Logical Methods Comput Sci 4(4)Google Scholar
  8. [DvGMZ07]
    Deng Y, van Glabbeek RJ, Morgan CC, Zhang C (2007) Scalar outcomes suffice for finitary probabilistic testing. In: De Nicola R (eds) European symposium on programming languages and systems (ESOP’07). Lecture notes in computer science, vol 4421. Springer, Berlin, pp 363–378Google Scholar
  9. [Hay87]
    Hayes I, editor (1987) Specification case studies. Prentice Hall, Englewood Cliffs (2nd edition published in 1992)Google Scholar
  10. [HHH+87]
    Hoare CAR, Hayes IJ, He J, Morgan CC, Roscoe A, Sanders JW, Sørensen IH, Spivey JM, Sufrin BA (1987) Laws of programming. Commun ACM 30(8): 672–686zbMATHCrossRefGoogle Scholar
  11. [Hon03]
    Honsberger R (2003) Mathematical diamonds. Dolcani mathematical expositions, vol 26. Mathematical Society of America, ProvidenceGoogle Scholar
  12. [ISO02]
    ISO (2002) Information technology—Z formal specification notation—syntax, type system and semantics. Technical Report ISO/IEC 13568, International Organization for Standardization, 2002 (International Standard)Google Scholar
  13. [MGCM08]
    McIver AK, Gonzalia C, Cohen E, Morgan CC (2008) Using probabilistic Kleene algebra pKA for protocol verification. J Logic Algebr Program 76(1): 90–111MathSciNetzbMATHCrossRefGoogle Scholar
  14. [MM02]
    McIver AK, Morgan CC (2002) Games, probability, and the quantitative μ-calculus qMμ. In: Logic for programming, artificial intelligence, and reasoning, LPAR ’02. Springer, Berlin, pp 292–310Google Scholar
  15. [MM05a]
    McIver AK, Morgan CC (2005) Abstraction, refinement and proof for probabilistic systems (Monographs in computer science). Springer, BerlinGoogle Scholar
  16. [MM05b]
    McIver AK, Morgan CC (2005) An elementary proof that Herman’s ring is Θ(N 2). Inf Process Lett 94(2): 79–84MathSciNetzbMATHCrossRefGoogle Scholar
  17. [MMSS96]
    Morgan CC, McIver AK, Seidel K, Sanders JW (1996) Refinement-oriented probability for CSP. Formal Asp Comput 8(6): 617–647zbMATHCrossRefGoogle Scholar
  18. [Mor66]
    Morgan: a suitable case for treatment. Film Poster (1966)Google Scholar
  19. [Mor78]
    Morgan CC (1978) Parallel programming without synchronisation. PhD thesis, University of SydneyGoogle Scholar
  20. [Mor85]
    Morgan CC (1985) Specification of a simplified network service in Z (problem 2). In: Denvir BT, Harwood WT, Jackson MI, Wray MJ (eds) The analysis of concurrent systems. Lecture notes in computer science, vol 207. Springer, Berlin, pp 318–344Google Scholar
  21. [Mor87]
    Morris JM (1987) A theoretical basis for stepwise refinement and the programming calculus. Sci Comput Programm 9(3): 287–306zbMATHCrossRefGoogle Scholar
  22. [Mor88]
    Morgan CC (1988) The specification statement. ACM Trans Programm Lang Syst 10(3): 403–419zbMATHCrossRefGoogle Scholar
  23. [Mor90a]
    Morgan CC (1990) Of wp and CSP. In: Gries D (eds) Beauty is our business: a birthday salute to Edsger W. Dijkstra. Springer, Berlin, pp 319–326Google Scholar
  24. [Mor90b]
    Morgan CC (1990) Programming from specifications. Prentice-Hall, Englewood CliffszbMATHGoogle Scholar
  25. [Mor06]
    Morgan CC (2006) The shadow knows: refinement of ignorance in sequential programs. In: Mathematics of program construction, MPC’06. Springer, Berlin, pp 359–378Google Scholar
  26. [Mor09]
    Morgan CC (2009) The shadow knows: refinement and security in sequential programs. Sci Comput Programm 74(8): 629–653zbMATHCrossRefGoogle Scholar
  27. [MS84]
    Morgan CC, Sufrin B (1984) Specification of the UNIX filing system. IEEE Trans Softw Eng 10(2): 128–142 (republished as Chapt. 4 in [Hay87])zbMATHCrossRefGoogle Scholar
  28. [MV92]
    Morgan CC, Vickers T (eds) (1992) On the refinement calculus. Springer, BerlinGoogle Scholar
  29. [WM90]
    Woodcock J, Morgan CC (1990) Refinement of state-based concurrent systems. In: Proceedings of the third international symposium of VDM Europe on VDM and Z—formal methods in software development, VDM’90. Springer, Berlin, pp 340–351Google Scholar

Copyright information

© British Computer Society 2012

Authors and Affiliations

  1. 1.KensingtonAustralia

Personalised recommendations