Full Abstraction for Linda

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.

[1]  Jean-Marie Jacquet,et al.  Modeling Coordination via Asynchronous Communication , 1997, COORDINATION.

[2]  Bengt Jonsson,et al.  A model and proof system for asynchronous networks , 1985, PODC '85.

[3]  David Gelernter,et al.  Generative communication in Linda , 1985, TOPL.

[4]  Roberto Gorrieri,et al.  On the Turing equivalence of Linda coordination primitives , 1999, EXPRESS.

[5]  Stephen D. Brookes.  Full Abstraction for a Shared-Variable Parallel Language , 1996, Inf. Comput..

[6]  Samuele Carpineti,et al.  Data and behavioral contracts for web services , 2007 .

[7]  Rocco De Nicola,et al.  KLAIM: A Kernel Language for Agents Interaction and Mobility , 1998, IEEE Trans. Software Eng..

[8]  Maurizio Gabbrielli,et al.  A Timed Linda Language and its Denotational Semantics , 2004, Fundam. Informaticae.

[9]  Luca Padovani,et al.  Stream Processing of XML Documents Made Easy with LALR(1) Parser Generators , 2007 .

[10]  Alan Chalmers,et al.  A Comparison of Linda Implementations in Java , 2000 .

[11]  Roberto Gorrieri,et al.  A Process Algebraic View of Linda Coordination Primitives , 1998, Theor. Comput. Sci..

[12]  Davide Sangiorgi,et al.  Behavioral equivalence in the polymorphic pi-calculus , 2000, JACM.

[13]  Jan J. M. M. Rutten,et al.  Fully Abstract Denotational Models for Nonuniform Concurrent Languages , 1994, Inf. Comput..

[14]  Graham Morgan,et al.  Design and Evaluation of a WideArea Distributed Shared Memory Middleware , 2007 .

[15]  Gianluigi Zavattaro,et al.  Towards a Hierarchy of Negative Test Operators for Generative Communication , 1998, EXPRESS.

[16]  Claudio Guidi,et al.  Formalizing languages for service oriented computing , 2007 .

[17]  Rocco De Nicola,et al.  Trace and Testing Equivalence on Asynchronous Processes , 2002, Inf. Comput..

[18]  Frank S. de Boer,et al.  A Fully Abstract Model for Concurrent Constraint Programming , 1991, TAPSOFT, Vol.1.

[19]  Ken Arnold,et al.  JavaSpaces¿ Principles, Patterns, and Practice , 1999 .

[20]  Davide Sangiorgi,et al.  On Bisimulations for the Asynchronous pi-Calculus , 1996, Theor. Comput. Sci..

[21]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[22]  Stephen D. Brookes,et al.  Full abstraction for a shared variable parallel language , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[23]  Roberto Gorrieri,et al.  Three Semantics of the Output Operation for Generative Communication , 1997, COORDINATION.

[24]  Julian Rathke,et al.  Java Jr: Fully Abstract Trace Semantics for a Core Java Language , 2005, ESOP.

[25]  Julian Rathke,et al.  Full abstraction for polymorphic pi-calculus , 2008, Theor. Comput. Sci..

[26]  N. Gessa.  An ontology-based approach to define and manage B2B interoperability , 2007 .

[27]  M. Bravetti.  Expressing Priorities, External Probabilities and Time in Process Algebra via Mixed Open/Closed Systems , 2007 .

[28]  Fabio Panzieri,et al.  An Object-based Fault-Tolerant Distributed Shared Memory Middleware , 2007 .