Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
A fully abstract model for concurrent constraint programming
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Fully abstract denotational models for nonuniform concurrent languages
Information and Computation
Behavioral equivalence in the polymorphic pi-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A process algebraic view of Linda coordination primitives
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
A model and proof system for asynchronous networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
On the turing equivalence of Linda coordination primitives
Theoretical Computer Science
Trace and testing equivalence on asynchronous processes
Information and Computation
JavaSpaces Principles, Patterns, and Practice
JavaSpaces Principles, Patterns, and Practice
Modeling Coordination via Asynchronous Communication
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Three Semantics of the Output Operation for Generative Communication
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
A Timed Linda Language and its Denotational Semantics
Fundamenta Informaticae
Full abstraction for polymorphic π-calculus
Theoretical Computer Science
Java JR: fully abstract trace semantics for a core java language
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
This paper investigates full abstraction of a trace semantics for two Linda-like languages. The first language provides primitives for adding and removing messages from a shared memory, local choice, parallel composition and recursion. The second one adds the possibility of checking for the absence of a message in the store. After having defined a denotational semantics based on traces, we obtain fully abstract semantics for both languages by using suitable abstractions in order to identify different traces which do not correspond to different operational behaviours.