References

• 1. 1)
     • C.A.R. Hoare . (1985) Communicating sequential processes.
  2. 2)
     • Woodcock, J.C.P., Cavalcanti, A.L.C.: `: a concurrent refinement language', Technical, 2001.
  3. 3)
     • J.C.P. Woodcock , J. Davies . (1996) Using Z—specification, refinement, and proof.
  4. 4)
     • E.W. Dijkstra . (1982) A personal summary of the Gries-Owicki theory, Selected writings on computing: a personal perspective.
  5. 5)
     • A.C.A. Sampaio , J.C.P. Woodcock , A.L.C. Cavalcanti . Refinement in Circus. Lect. Notes Comput. Sci. , 451 - 470
  6. 6)
     • C.C. Morgan . (1994) Programming from specifications.
  7. 7)
     • Cavalcanti, A.L.C., Sampaio, A.C.A., Woodcock, J.C.P.: `Refinement of actions in Circus', Proceedings of REFINE'2002, July 2002, Electronic Notes in Theoretical Computer Science.
  8. 8)
     • Woodcock, J.C.P., Cavalcanti, A.L.C.: `A concurrent language for refinement', Proceedings of IWFM'01: 5th Irish workshop in formal methods, July 2001, Dublin, Ireland.
  9. 9)
     • A.W. Roscoe . Denotational semantics for occam. Lect. Notes Comput. Sci. , 306 - 329
  10. 10)
      • A.L.C. Cavalcanti , J.C.P. Woodcock . ZRC—A refinement calculus for Z. Form. Asp. Comput. , 3 , 267 - 289
  11. 11)
      • A.W. Roscoe . (1998) The theory and practice of concurrency.
  12. 12)
      • Fischer, C.: `How to combine Z with a process algebra', Proceedings of ZUM'98: The Z formal specification notation, September 1998, York, UK, Springer-Verlag.
  13. 13)
      • Woodcock, J.C.P., Cavalcanti, A.L.C.: `The steam boiler in a unified theory of Z and CSP', Proceedings of the 8th Asia-Pacific Software Engineering Conference (APSEC 2001), 2001, IEEE Press.
  14. 14)
      • D. Gries . An exercise in proving parallel programs correct. Commun. ACM , 12 , 921 - 930
  15. 15)
      • J.C.P. Woodcock , A.L.C. Cavalcanti . The semantics of Circus. Lect. Notes Comput. Sci. , 184 - 203
  16. 16)
      • Hoare, C.A.R., Roscoe, A.W.: `Programs as executable predicates', Proceedings of the International Conference on Fifth generation computer systems 1984 (FGCS'84), November 1984, Tokyo, Japan, Institute for New Generation Computer Technology, p. 220–228.
  17. 17)
      • Owicki, S.: `Axiomatic proof techniques for parallel programs', 1975, PhD, Cornell University, Gries, D..
  18. 18)
      • S. Owicki , D. Gries . An axiomatic proof technique for parallel programs I. Acta Inform. , 319 - 340
  19. 19)
      • Back, R.J.R.: `On the correctness of refinement steps in program development', 1978, PhD, University of Helsinki, Department of Computer Science, Report A-1978-4.
  20. 20)
      • C.A.R. Hoare . An axiomatic basis for computer programming. Commun. ACM , 576 - 580
  21. 21)
      • Morgan, C.C., Robinson, K., Gardiner, P.H.B.: `On the refinement calculus', TM-PRG-70, Technical Monograph, 1988.
  22. 22)
      • J.M. Spivey . (1989) The Z notation: a reference manual.
  23. 23)
      • S. Owicki , D. Gries . Verifying properties of parallel programs: an axiomatic approach. Commun. ACM , 5 , 279 - 285
  24. 24)
      • L. Lamport . The ‘Hoare logic’ of concurrent programs. Acta Inform. , 21 - 37
  25. 25)
      • A.W. Roscoe , C.A.R. Hoare . The laws of occam programming. Theoretical Computer Science , 2 , 177 - 229
  26. 26)
      • E.W. Dijkstra . (1976) A discipline of programming.
  27. 27)
      • Meisels, I.: `Software Manual for Windows Z/EVES Version 2.1', 2000, TR-97-5505-04g.
  28. 28)
      • C.A.R. Hoare . Proof of a structured program: The Sieve of Eratosthenes. Br. Comput. Soc. Comput. J. , 4 , 321 - 325
  29. 29)
      • R.J.R. Back . (1992) Refinement of parallel and reactive programs, Lect. Notes Comput. Sci..
  30. 30)
      • A. Kaldewaij . (1990) Programming: the derivation of algorithms.
  31. 31)
      • C.A.R. Hoare , J. He . (1998) Unifying theories of programming.
  32. 32)
      • Lamport, L.: ` and ', 17, 1989.