Semantics and analysis of linda-based languages

  • Régis Cridlig
  • Eric Goubault
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 724)


In this paper we define a process algebra abstracting relevant features of the Linda paradigm to parallel computation and show how to give it a semantics based on higher-dimensional automata which is more expressive than interleaving transition systems. In particular, it is a truly concurrent operational semantics, compositional in nature.

Furthermore this semantics leads us to new kinds of abstract interpretations useful for the static analysis of concurrency. One of these addresses the correctness of implementations of Linda programs on real computers (which have a finite number of processors).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CC92]
    P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4), 1992.Google Scholar
  2. [CG90]
    N. Carriero and D. Gelernter. How to write parallel programs A first course. MIT Press, Cambridge, Mass., 1990.Google Scholar
  3. [CJY92]
    P. Ciancarini, K. K. Jensen, and D. Yankelevitch. The semantics of a parallel language based on a shared data space. Technical Report 26, DIUP, 1992.Google Scholar
  4. [FS90]
    P. J. Freyd and A. Scedrov. Categories, allegories. In North-Holland Mathematical Library, volume 39. North-Holland, 1990.Google Scholar
  5. [GJ92]
    E. Goubault and T.P. Jensen. Homology of higher-dimensional automata. In Proc. of CONCUR'92, Stonybrook, New York, August 1992. Springer-Verlag.Google Scholar
  6. [Gla91]
    R. van Glabbeek. Bisimulation semantics for higher dimensional automata. Technical report, Stanford University, 1991.Google Scholar
  7. [Gou93]
    E. Goubault. Towards a theory of higher-dimensional automata. Technical report, Ecole Normale Supérieure, to appear 1993.Google Scholar
  8. [Hoa78]
    C. A. R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):667–677, August 1978.Google Scholar
  9. [HU79]
    J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.Google Scholar
  10. [Jag91]
    S. Jagannathan. Expressing fine-grained parallelism using concurrent data structures. In J. B. Banâtre and D. Le Métayer, editors, Research Directions in High-Level Parallel Programming Languages, volume 574 of Lecture Notes in Computer Science, pages 77–92, June 1991.Google Scholar
  11. [Mac71]
    S. Mac Lane. Categories for the working mathematician. Springer-Verlag, 1971.Google Scholar
  12. [Mas92]
    F. Masdupuy. Array operations abstraction using semantic analysis of trapezoid congruences. In International Conference on Supercomputing, July 1992.Google Scholar
  13. [May83]
    D. May. OCCAM. ACM SIGPLAN Notices, 18(4):69–79, April 1983.Google Scholar
  14. [Pra91]
    V. Pratt. Modeling concurrency with geometry. In Proc. 18th ACM Symposium on Principles of Programming Languages. ACM Press, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  1. 1.Laboratoire d'Informatique de l'Ecole Normale SupérieureFrance

Personalised recommendations