Communications of the ACM
Coordination languages and their significance
Communications of the ACM
Fully abstract denotational models for nonuniform concurrent languages
Information and Computation
Control flow semantics
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Proceedings of the First International Conference on Coordination Languages and Models
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Proceedings of the Second International Conference on Coordination Languages and Models
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Proceedings of the Third International Conference on Coordination Languages and Models
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
Proceedings of the 4th International Conference on Coordination Languages and Models
COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
Proceedings of the 5th International Conference on Coordination Models and Languages
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
The Failure of Failures in a Paradigm for Asynchronous Communication
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
A Process Algebra Based on LINDA
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Modeling Coordination via Asynchronous Communication
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Coordination Models and Languages: 6th International Conference, Coordination 2004, Pisa, Italy, February 24-27, 2004: Proceedings (LECTURE NOTES IN COMPUTER SCIENCE)
| Hi-index | 0.00 |
The paper proposes a theoretical study of a coordination language embodying Linda's asynchronous communication primitives with a refined matching mechanism based on pairs composed of attribute names associated with their values. Computations in this language are described by means of an operational semantics, reporting the whole traces of executions. The non-compositionality of this intuitive operational semantics motivates the design of a compositional and fully abstract denotational semantics.