scientific article; zbMATH DE number 3890713

From MaRDI portal
Publication:3347276





[For the entire collection see Zbl 0533.00025.] 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.




Cited in
(31)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347276)