Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1984: STACS 84 pp 163–173Cite as

Denotational semantics of concurrent programs with shared memory

  • Contibuted Papers
  • Conference paper
  • First Online:

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

Abstract

For a simple classical procedural programming language for writing concurrent programs with protected access to shared memory a denotational semantics is given. It is, in particular, based on techniques developed for giving semantic models for languages for describing tightly coupled communicating systems based on the rendezvous concept like CSP and CCS and others for describing loosely coupled systems based on implicit buffering using notations as found in applicative multiprogramming such as nondeterministic stream processing and data flow networks. 13 Dec 83

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Broy: Fixed Point Theory for Communication and Concurrency. In: D. Björner (ed): IFIP TC2 Working Conference on Formal Description of Programming Concepts II, Garmisch, June 1982, North Holland 1983, 125–147

    Google Scholar 

  2. M. Broy: Semantics of Communicating Processes. Information and Control (to appear)

    Google Scholar 

  3. E.W. Dijkstra: Co-Operating Sequential Processes. In: F. Genuys (ed.): Programming Languages. Academic Press, 1968, 43–112

    Google Scholar 

  4. C.A.R. Hoare: Towards a Theory of Parallel Programming. In: C.A.R. Hoare, R.H. Perrot (eds.): Operating Systems Techniques, Academic Press, New York 1972, 61–71

    Google Scholar 

  5. C.A.R. Hoare: Monitors: An Operating Systems Structuring Concept. Comm. ACM 17:10, October 1974, 549–557

    Google Scholar 

  6. C.A.R. Hoare: Communicating Sequential Processes. Comm. ACM 21:8, August 1978, 666–677

    Google Scholar 

  7. C.A.R. Hoare, S.D. Brookes, A.W. Roscoe: A Theory of Communicating Sequential Processes. Oxford University Computing Laboratory, Programming Research Group, Technical Monograph PRG-21, Oxford 1981

    Google Scholar 

  8. R.M. Keller: Denotational Models for Parallel Programs with Indeterminate Operators. In: E.J. Neuhold (ed.): Formal Description of Programming Concepts. Amsterdam: North-Holland 1978, 337–366

    Google Scholar 

  9. R. Milner: A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Berlin-Heidelberg-New York: Springer 1980

    Google Scholar 

  10. G. Plotkin: A Powerdomain Construction. SIAM J. Computing 5, 1976, 452–486

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Passau Fakultät für Informatik, Postfach 2540, D-8390, Passau

    Manfred Broy

Authors
  1. Manfred Broy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Fontet K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Broy, M. (1984). Denotational semantics of concurrent programs with shared memory. In: Fontet, M., Mehlhorn, K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12920-0_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-12920-0_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12920-2

  • Online ISBN: 978-3-540-38805-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation