TY - GEN
T1 - Denotational semantics of concurrent programs with shared memory
AU - Broy, Manfred
N1 - Publisher Copyright:
© 1984, Springer Verlag. All rights reserved.
PY - 1984
Y1 - 1984
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84910516999&partnerID=8YFLogxK
U2 - 10.1007/3-540-12920-0_15
DO - 10.1007/3-540-12920-0_15
M3 - Conference contribution
AN - SCOPUS:84910516999
SN - 9783540129202
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 163
EP - 173
BT - STACS 1984 - Symposium of Theoretical Aspects of Computer Science
A2 - Mehlhorn, K.
A2 - Fontet, M.
PB - Springer Verlag
T2 - 1st Annual Symposium on Theoretical Aspects of Computer Science, STACS 1985
Y2 - 11 April 1984 through 13 April 1984
ER -