Abstract
A general construct for locality in languages based on asynchronous communication is introduced which allows a uniform semantic description of such apparently diverse notions as the introduction of local variables in concurrent imperative languages with shared variables and the hiding of logical variables in concurrent constraint languages.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.A. Bergstra and J.W. Klop. A complete inference system for regular processes with silent moves. In F.R. Drake and J.K. Truss, editors, Proceedings Logic Colloquium 1986, pages 21–81, Hull, 1986. North-Holland.
S.D. Brookes. A fully abstract semantics for an ALGOL-like language with sharing. Technical report, Carnegie-Mellon University, Pittsburgh, 1985.
J.W. de Bakker. Mathematical theory of program correctness. Prentice-Hall International, 1980.
F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. The failure of failures in a paradigm for asynchronous communication. In J.C.M. Baeten and J.F. Groote, editors, Proceedings of CONCUR'91, volume 527 of Lecture Notes in Computer Science, pages 111–126. Springer-Verlag, 1991.
F.S. de Boer and C. Palamidessi. A fully abstract model for concurrent constraint programming. In S. Abramsky and T.S.E. Maibaum, editors, Proceedings of TAPSOFT/CAAP 1991, volume 493 of Lecture Notes in Computer Science, pages 296–319. Springer-Verlag, 1991.
L. Henkin, J.D. Monk, and A. Tarski. Cylindric algebras (Part 1). North Holland Publishing company, 1971.
H.K. Hung and J.I. Zucker. Semantics of pointers, referencing and dereferencing with intensional logic. In Proceedings of Logic in Computer Science 1991, page ?? IEEE Computer Society Press, 1991.
R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, New York, 1980.
G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, 1981.
V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, January 1989. Published by The MIT Press, U.S.A., 1990.
V.A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. of the 17th ACM Symposium on Principles of Programming Languages, pages 232–245, New York, 1989. ACM.
V.A. Saraswat, M. Rinard, and P. Panangaden. A fully abstract semantics for concurrent constraint programming. In Proc. of the 18th ACM Symposium on Principles of Programming Languages, New York, 1990. ACM.
R.J. van Glabbeek. Bounded nondeterminism and the approximation induction principle in process algebra. In F.J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors, Proceedings STACS 1987, volume 247 of Lecture Notes in Computer Science, pages 336–367 Springer-Verlag, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Boer, F.S., Kok, J.N., Palamidessi, C., Rutten, J.J.M.M. (1993). On blocks: locality and asynchronous communication. In: de Bakker, J.W., de Roever, W.P., Rozenberg, G. (eds) Semantics: Foundations and Applications. REX 1992. Lecture Notes in Computer Science, vol 666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56596-5_29
Download citation
DOI: https://doi.org/10.1007/3-540-56596-5_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56596-3
Online ISBN: 978-3-540-47595-8
eBook Packages: Springer Book Archive