Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic and Computation, 2(4), 1992.
N. Carriero and D. Gelernter. How to write parallel programs A first course. MIT Press, Cambridge, Mass., 1990.
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.
P. J. Freyd and A. Scedrov. Categories, allegories. In North-Holland Mathematical Library, volume 39. North-Holland, 1990.
E. Goubault and T.P. Jensen. Homology of higher-dimensional automata. In Proc. of CONCUR'92, Stonybrook, New York, August 1992. Springer-Verlag.
R. van Glabbeek. Bisimulation semantics for higher dimensional automata. Technical report, Stanford University, 1991.
E. Goubault. Towards a theory of higher-dimensional automata. Technical report, Ecole Normale Supérieure, to appear 1993.
C. A. R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):667–677, August 1978.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
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.
S. Mac Lane. Categories for the working mathematician. Springer-Verlag, 1971.
F. Masdupuy. Array operations abstraction using semantic analysis of trapezoid congruences. In International Conference on Supercomputing, July 1992.
D. May. OCCAM. ACM SIGPLAN Notices, 18(4):69–79, April 1983.
V. Pratt. Modeling concurrency with geometry. In Proc. 18th ACM Symposium on Principles of Programming Languages. ACM Press, 1991.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cridlig, R., Goubault, E. (1993). Semantics and analysis of linda-based languages. In: Cousot, P., Falaschi, M., Filé, G., Rauzy, A. (eds) Static Analysis. WSA 1993. Lecture Notes in Computer Science, vol 724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57264-3_30
Download citation
DOI: https://doi.org/10.1007/3-540-57264-3_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57264-0
Online ISBN: 978-3-540-48027-3
eBook Packages: Springer Book Archive