Denotational semantics of concurrent programs with shared memory

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.