Skip to main content

Specification of communicating processes and process implementation correctness

  • Conference paper
  • First Online:
International Symposium on Programming (Programming 1982)

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

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ASHCROFT, E.A. and WADGE, W.W Lucid — A formal system for writing and proving programs SIAM Journal of Computing, Vol. 5, No 3, September 1976

    Google Scholar 

  2. BERT, D. and SOLER, R. About data-type genericity International Colloquium on Formalization of Programming Concepts, Peniscola, Lecture Notes in Computer Science, No 107, Springer-Verlag, 1981

    Google Scholar 

  3. DARONDEAU, Ph. An enlarged definition and complete axiomatization of observational congruence of finite processes IRISA Research Report, Rennes, October 1981

    Google Scholar 

  4. DE BAKKER, J.W. Semantics and termination of non deterministic programs 3rd. ICALP, Edited by S. Michaelson and R. Milner, Edinburgh Edinburgh University Press, July 1976

    Google Scholar 

  5. DIJKSTRA, E.W. A discipline of programming Prentice Hall, 1976

    Google Scholar 

  6. GUERREIRO, P. Relational semantics of strongly communicating sequential processes International Colloquium on Formalization of Programming Concepts, Peniscola, Lecture Notes in Computer Science, No 107, Springer-Verlag, 1981

    Google Scholar 

  7. GUESSARIAN, I. Algebraic semantics Lecture Notes in Computer Science, No 99, Springer-Verlag, 1981

    Google Scholar 

  8. HOARE, C.A.R. Communicating sequential processes CACM, Vol. 21, No 8, August 1978

    Google Scholar 

  9. HOARE, C.A.R. A calculus of total correctness for communicating processes Science of Computer Programming, Vol. 1, No 12, October 1981

    Google Scholar 

  10. ICHBIAH, J.D. et al. Rationale for the design of the ADA programming language SIGPLAN Notices, Vol. 14, No 6, June 1979

    Google Scholar 

  11. JORRAND, Ph. Specification and analysis of communication protocols IBM Research Report, RJ 2853, July 1980

    Google Scholar 

  12. JORRAND, Ph. Description and composition of communicating processes. Problems of analysis and correctness IMAG Research Report, Grenoble, January 1982

    Google Scholar 

  13. MILNER, R. A calculus of communicating systems Lecture Notes in Computer Science, No 92, Springer-Verlag, 1980

    Google Scholar 

  14. NIVAT, M. Langages algébriques sur le magma libre et sémantique des schémas de programmes 1st. ICALP, Edited by M. Nivat, Paris North-Holland, July 1972

    Google Scholar 

  15. QUEILLE, J.P. and SIFAKIS, J. Specification and verification of concurrent systems in CESAR IMAG Research Report, Grenoble, June 1981

    Google Scholar 

  16. SIFAKIS, J. Deadlock and livelocks in transition systems Mathematical Foundation of Computer Science Lecture Notes in Computer Science, No 88, Springer-Verlag, 1980

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mariangiola Dezani-Ciancaglini Ugo Montanari

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jorrand, P. (1982). Specification of communicating processes and process implementation correctness. In: Dezani-Ciancaglini, M., Montanari, U. (eds) International Symposium on Programming. Programming 1982. Lecture Notes in Computer Science, vol 137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11494-7_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-11494-7_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11494-9

  • Online ISBN: 978-3-540-39184-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics