Full Abstraction for Linda

  • Cinzia Di Giusto
  • Maurizio Gabbrielli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4960)


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.


Shared Memory Operational Semantic Local Choice Parallel Composition Denotational Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations of the asynchronous π-calculus. Theor. Comput. Sci. 195(2), 291–324 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Boreale, M., Nicola, R.D., Pugliese, R.: Trace and testing equivalence on asynchronous processes. Inf. Comput. 172(2), 139–164 (2002)zbMATHCrossRefGoogle Scholar
  3. 3.
    Brogi, A., Jaquet, J.-M.: Modeling coordination via asynchronous communication. In: Proceedings of the 2nd COORD 1997, London, UK, pp. 238–255. Springer, Heidelberg (1997)Google Scholar
  4. 4.
    Brookes, S.D.: Full abstraction for a shared-variable parallel language. Information and Computation 127(2), 145–163 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Busi, N., Gorrieri, R., Zavattaro, G.: Three semantics of the output operation for generative communication. In: Proceedings of the 2nd COORD 1997, London, UK, pp. 205–219. Springer, Heidelberg (1997)Google Scholar
  6. 6.
    Busi, N., Gorrieri, R., Zavattaro, G.: A process algebraic view of linda coordination primitives. Theor. Comput. Sci. 192(2), 167–199 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Busi, N., Gorrieri, R., Zavattaro, G.: On the turing equivalence of linda coordination primitives. Theor. Comput. Sci. 230(1-2), 260–261 (2000)MathSciNetGoogle Scholar
  8. 8.
    de Boer, F.S., Gabbrielli, M., Meo, M.C.: A timed linda language and its denotational semantics. Fundamenta Informaticae 63(4) (2004)Google Scholar
  9. 9.
    de Boer, F.S., Palamidessi, C.: A fully abstract model for concurrent constraint programming. In: Proceedings TAPSOFT/CAAP 1991, vol. 1, pp. 296–319. Springer, New York (1991)Google Scholar
  10. 10.
    Freeman, E., Arnold, K., Hupfer, S.: JavaSpaces Principles, Patterns, and Practice. Addison-Wesley Longman Ltd, Essex, UK (1999)Google Scholar
  11. 11.
    Gelernter, D.: Generative communication in linda. ACM Trans. Program. Lang. Syst. 7(1), 80–112 (1985)zbMATHCrossRefGoogle Scholar
  12. 12.
    Horita, E., de Bakker, J.W., Rutten, J.J.M.M.: Fully abstract denotational models for nonuniform concurrent languages. Inf. Comput. 115(1), 125–178 (1994)zbMATHCrossRefGoogle Scholar
  13. 13.
  14. 14.
    Jeffrey, A., Rathke, J.: Java jr.: Fully abstract trace semantics for a core java language. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 423–438. Springer, Heidelberg (2005)Google Scholar
  15. 15.
    Jeffrey, A.S.A., Rathke, J.: Full abstraction for polymorphic pi-calculus. Theoretical Computer Science (to appear, 2007)Google Scholar
  16. 16.
    Jonsson, B.: A model and proof system for asynchronous networks. In: Proc. of the 4th ACM symposium on Principles of distributed computing, pp. 49–58. ACM Press, New York (1985)CrossRefGoogle Scholar
  17. 17.
    Nicola, R.D., Ferrari, G.L., Pugliese, R.: Klaim: A kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering 24(5), 315–330 (1998)CrossRefGoogle Scholar
  18. 18.
    Pierce, B.C., Sangiorgi, D.: Behavioral equivalence in the polymorphic pi-calculus. In: Proceedings of the 24th ACM SIGPLAN-SIGACT, pp. 242–255. ACM Press, New York (1997)CrossRefGoogle Scholar
  19. 19.
    Wells, G., Clayton, P., Chalmers, A.G.: A Comparison of Linda Implementations in Java. In: Communicating Process Architectures 2000, september 2000, pp. 63–76 (2000)Google Scholar
  20. 20.
    Zavattaro, G.: Towards a hierarchy of negative test operators for generative communication. Electr. Notes Theor. Comput. Sci. 16(2) (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Cinzia Di Giusto
    • 1
  • Maurizio Gabbrielli
    • 1
  1. 1.Dip. Scienze dell’InformazioneUniversità di BolognaBolognaItaly

Personalised recommendations