Denotational semantics of concurrent programs with shared memory

  • Manfred Broy
Contibuted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 166)


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


Output State Shared Memory Sequential Process Input State Semantic Representation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Broy 82]
    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–147Google Scholar
  2. [Broy 83]
    M. Broy: Semantics of Communicating Processes. Information and Control (to appear)Google Scholar
  3. [Dijkstra 68]
    E.W. Dijkstra: Co-Operating Sequential Processes. In: F. Genuys (ed.): Programming Languages. Academic Press, 1968, 43–112Google Scholar
  4. [Hoare 71]
    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–71Google Scholar
  5. [Hoare 74]
    C.A.R. Hoare: Monitors: An Operating Systems Structuring Concept. Comm. ACM 17:10, October 1974, 549–557Google Scholar
  6. [Hoare 78]
    C.A.R. Hoare: Communicating Sequential Processes. Comm. ACM 21:8, August 1978, 666–677Google Scholar
  7. [Hoare et al. 81]
    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 1981Google Scholar
  8. [Keller 78]
    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–366Google Scholar
  9. [Milner 80]
    R. Milner: A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Berlin-Heidelberg-New York: Springer 1980Google Scholar
  10. [Plotkin 76]
    G. Plotkin: A Powerdomain Construction. SIAM J. Computing 5, 1976, 452–486Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Manfred Broy
    • 1
  1. 1.Universität Passau Fakultät für InformatikPassau

Personalised recommendations