论文信息 - Semantics and Analysis of Linda-Based Languages

Semantics and Analysis of Linda-Based Languages

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.

Eric Goubault | Régis Cridlig | É. Goubault | Régis Cridlig

[1] S. Maclane,et al. Categories for the Working Mathematician , 1971 .

[2] Simon L. Peyton Jones,et al. Imperative functional programming , 1993, POPL '93.

[3] Nicholas Carriero,et al. How to write parallel programs - a first course , 1990 .

[4] Vaughan R. Pratt,et al. Modeling concurrency with geometry , 1991, POPL '91.

[5] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[6] Leon S. Levy. A walk through AWK , 1983, SIGP.

[7] S. Lane. Categories for the Working Mathematician , 1971 .

[8] Eric Goubault,et al. Homology of Higher Dimensional Automata , 1992, CONCUR.

[9] Andre Scedrov,et al. Categories, allegories , 1990, North-Holland mathematical library.

[10] François Masdupuy,et al. Array abstractions using semantic analysis of trapezoid congruences , 1992, ICS '92.

[11] Paolo Ciancarini,et al. The Semantics of a Parallel Language based on a Shared Data space , 1992 .

[12] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[13] Suresh Jagannathan. Expressing Fine-Grained Parallelism Using Concurrent Data Structures , 1991, Research Directions in High-Level Parallel Programming Languages.

[14] Patrick Cousot,et al. Abstract Interpretation Frameworks , 1992, J. Log. Comput..