On blocks: locality and asynchronous communication

Extended abstract
  • F. S. de Boer
  • J. N. Kok
  • C. Palamidessi
  • J. J. M. M. Rutten
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 666)


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.


Parallelism locality block structure asynchronous communication 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BK86]
    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.Google Scholar
  2. [Bro85]
    S.D. Brookes. A fully abstract semantics for an ALGOL-like language with sharing. Technical report, Carnegie-Mellon University, Pittsburgh, 1985.Google Scholar
  3. [dB80]
    J.W. de Bakker. Mathematical theory of program correctness. Prentice-Hall International, 1980.Google Scholar
  4. [dBKPR91]
    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.Google Scholar
  5. [dBP91]
    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.Google Scholar
  6. [HMT71]
    L. Henkin, J.D. Monk, and A. Tarski. Cylindric algebras (Part 1). North Holland Publishing company, 1971.Google Scholar
  7. [HZ91]
    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.Google Scholar
  8. [Mil80]
    R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, New York, 1980.Google Scholar
  9. [Plo81]
    G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, 1981.Google Scholar
  10. [Sar89]
    V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, January 1989. Published by The MIT Press, U.S.A., 1990.Google Scholar
  11. [SR89]
    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.Google Scholar
  12. [SRP90]
    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.Google Scholar
  13. [vG87]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • F. S. de Boer
    • 1
  • J. N. Kok
    • 2
  • C. Palamidessi
    • 3
  • J. J. M. M. Rutten
    • 4
  1. 1.Department of Computer ScienceTechnical University EindhovenMB EindhovenThe Netherlands
  2. 2.Department of Computer ScienceUtrecht UniversityTB UtrechtThe Netherlands
  3. 3.Dipartimento di InformaticaUniversità di PisaPisaItaly
  4. 4.CWISJ AmsterdamThe Netherlands

Personalised recommendations