Klaim: A kernel language for agents interaction and mobility

IEEE Transactions on Software Engineering

Volumn 24, Issue 5, 1998, Pages 315-330

  De Nicola, Rocco ^a   Ferrari, Gian Luigi ^a   Pugliese, Rosario ^b  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

Coordination models; Language design; Mobile code languages; Programming languages; Semantics of programming languages

Indexed keywords

EID: 0000372791     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.685256     Document Type: Article

References (41)

1. M. Abadi and A. Gordon, "A Calculus for Cryptographic Protocols: the Spi-Calculus," Proc. Fourth ACM Conf. Computer and Comm. Security, 1997.
2. R. Amadio and S. Prasad, "Localities and Failures," FCT&TCS 14, Proc., P.S. Thiagarajan, ed., Lecture Notes in Computer Science 880, pp. 205-216. Springer-Verlag, 1994.
3. K. Arnold and J. Gosling, The Java Programming Language. Addison-Wesley, 1996.
4. G. Berry and G. Boudol, "The Chemical Abstract Machine," Theoretical Computer Science, vol. 96, pp. 217-248, 1992.
5. L. Bettini, "Progetto e Realizzazione di un Linguaggio di Programmazione per Codice Mobile," in Italian, Tesi di Laurea, Dipartimento di Sistemi e Informatica, Università di Firenze, 1998.
6. G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn, "Observing Localities," Theoretical Computer Science, vol. 114, 1993.
7. L. Cardelli, "A Language with Distributed Scope," Computing Systems, vol. 8, no. 1, pp. 27-59. MIT Press, 1995.
8. L. Cardelli, "Global Computation Manuscript," 1996. Available at URL http://www.luca.demon.co.uk.
9. L. Cardelli and A. Gordon, "Mobile Ambients," FoSSaCS'98, M. Nivat, ed., Lecture Notes in Computer Science 1378, pp. 140-145. Springer-Verlag, 1998.
10. N. Carriero and D. Gelernter, "Linda in Context," Comm. ACM, vol. 32, no. 4, pp. 444-458, 1989.
11. N. Carriero, D. Gelernter, and J. Leichter, "Distributed Data Structures in Linda," Proc. ACM Symp. Principles of Programming Languages, New York: ACM, pp. 236-242, 1986.
12. P. Ciancarini and D. Rossi, "Jada: Coordination and Communication for Java agents," Mobile Object Systems: Towards the Programmable Internet," J. Vitek and C. Tschudin, eds., Lecture Notes In Computer Science 1222, pp. 213-228. Springer-Verlag, 1997.
13. F. Corradini and R. De Nicola, "Locality Based Semantics for Process Algebras," Acta Informatica, vol. 34, pp. 291-324, 1997.
14. G. Cugola, C. Ghezzi, G.P. Picco, and G. Vigna, "Analyzing Mobile Code Languages," J. Vitek and C. Tschudin, eds., Mobile Object Systems, Lecture Notes in Computer Science 1222. Springer-Verlag, 1997.
15. R. De Nicola, G. Ferrari, and R. Pugliese, "Locality Based Linda: Programming with Explicit Localities," TAPSOFT '97, Proc., M. Bidoit and M. Dauchet, eds., Lecture Notes in Computer Science 1214, pp. 712-726. Springer-Verlag, 1997.
16. R. De Nicola, G. Ferrari, and R. Pugliese, "Coordinating Mobile Agents via Blackboards and Access Rights," Coordination '97, Proc., D. Garlan and D. Le Metayer, eds., Lecture Notes in Computer Science 1282, pp. 220-237, Springer-Verlag, 1997.
17. R. De Nicola, G. Ferrari, R. Pugliese, and B. Venneri, "Types for Access Control," submitted for publication, 1998. URL http://di.unipi.it/~giangi/papers
18. R. De Nicola and R. Pugliese, "A Process Algebra Based on Linda. Coordination '96, Proc., P. Ciancarini and C. Hankin, eds., Lecture Notes in Computer Science 1061, pp. 160-178. Springer-Verlag, 1996.
19. C. Fournet, G. Gonthier, J.-L. Lévy, L. Maranget, and D. Rémy, "A Calculus of Mobile Agents," Concur '96, Proc., U. Montanari and V Sassone, eds., Lecture Notes In Computer Science 1119, pp. 406-421. Springer-Verlag, 1996.
20. D. Gelernter, "Generative Communication in Linda," ACM Trans, on Programming Languages and Systems, vol. 7, no. 1, pp. 80-112, 1985.
21. D. Gelernter, "Multiple Tuple Spaces in Linda," PARLE'89, Proc., G. Goos and J. Hartmanis, eds., Lecture Notes in Computer Science 365, pp. 20-27, 1989.
22. D. Gelernter, N. Carriero, and S. Chandran, et al., "Parallel Programming in Linda," Proc. Int'l Conf. Parallel Programming, IEEE, pp. 255-263, 1985.
23. A. Giacalone, P. Mishra, and S. Prasad, "Facile: A Symmetric Integration of Concurrent and Functional Programming," Int'l J. Parallel Programming, vol. 18, no. 2,1989.
24. M. Hennessy and H. Lin, "Symbolic Bisimulations," Theoretical Computer Science, vol. 138, pp. 353-389, 1995.
25. C.A.R. Hoare, Communicating Sequential Processes. Prentice Hall International, 1985.
26. IBM Aglets Workbench-Home Page, 1996. URL address: http://www.trl.ibm.co.jp/aglets/
27. A. Ingolfsdottir, "Semantic Models for Communicating Processes with Value-Passing," PhD thesis, Univ. of Edinburgh, 1994.
28. N. Kobayashi, B. Pierce, and D. Turner, "Linearity and the π-Calculus," Proc. POPL'96, 1996.
29. J. Leitcher, Shared Memories, Buses and LANs - Linda Implementations Across the Spectrum of Connectivity," Research Report YALEU/DCS/TR714, Dept. of Computer Science, Yale Univ., 1989.
30. R. Milner, Communication and Concurrency. Prentice Hall International, 1989.
31. R. Milner, "The Polyadic π-Calculus: A Tutorial," Technical Report, ECS-LFCS91-180, 1991.
32. R. Milner, J. Parrow, and D. Walker, "A Calculus of Mobile Processes, Part I and II, Information and Computation, vol. 100, pp. 1-77, 1992.
33. B. Pierce and D. Turner, "Concurrent Objects in a Process Calculus," Theory and Practice of Parallel Programming, T. Ito and A. Yonezawa, eds., Lecture Notes in Computer Science 907, pp. 186-215, 1994.
34. B. Pierce and D. Sangiorgi, "Typing and Subtyping for Mobile Processes," Proc. LICS '93, IEEE Press, 1993. A full version appears in Mathematical Struction in Computer Science.
35. G.D. Plotkin, "A Structural Approach to Operational Semantics," Technical Report DAIMI FN19, Dept. of Computer Science, Aarhus Univ., 1981.
36. G.D. Plotkin, "Lectures Notes in Domain Theory," Univ. of Edinburgh, 1983.
37. R. Pugliese, "Semantic Theories for Asynchronous Languages," PhD thesis VIII96-6, Dip. Scienze dell'Informazione, Univ. di Roma 'La Sapienza', 1996.
38. J. Reppy, "Higher Order Concurrency," PhD thesis, Cornell Univ., Tr92-1285, 1992.
39. B. Thomsen, L. Leth, and A. Giacalone, "Some Issues in the Semantics of Facile Distributed Programming," Proc. REX Workshop Semantics: Foundations and Applications, J.W. de Bakker, W-P. de Roever, and G. Rezenberg, eds., Lecture Notes in Computer Science 666, pp. 563-593. Springer-Verlag, 1992.
40. D. Volpano and G. Smith, "A Typed-Based Approach to Program Security," Proc. TAPSOFT '97, Lecture Notes in Computer Science 1214, pp. 607-621. Springer-Verlag, 1997.
41. J.E. White, "Mobile Agents," Software Agents, J.M. Bradshaw, ed., pp. 437-471, 1996.