Part of the Lecture Notes in Computer Science book series (LNCS, volume 191)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

1.5 References

  1. [AFR80]
    Apt, K.R., Francez, N. and de Roever, W.P. A proof system for communicating sequential processes. ACM Transactions on Programming Languages and Systems, Vol. 2, No. 3, July 1980, pp 359–385.CrossRefGoogle Scholar
  2. [MC81]
    Chandy, K. and Misra, J. Proofs of networks of processes. IEEE TOSE, Vol. SE-7, No. 4, July 1981.Google Scholar
  3. [Ho81]
    Hoare, C.A.R. A Calculus for Total Correctness for Communicating Sequential Processes. Science of Computer Programming, Vol. 1, 1981, pp. 49–72.CrossRefGoogle Scholar
  4. [Jo80]
    Jones, C.B. Software Development: a rigorous approach. Prentice-Hall International, 1980.Google Scholar
  5. [LG81]
    Levin, G.M. and Gries, D. A Proof Technique for Communicating Sequential Processes. Acta Information, Vol. 15, 1981, pp 281–302.Google Scholar
  6. [Lu78]
    Lucas, P. On the Formaisation of Programming Languages: Early History and Main Approaches. in ‘The Vienna Development Method: The Meta Language', Bjorner, D. and Jones, C.B. LNCS, Vol. 61, Springer-Verlag, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Personalised recommendations