Location-independent communication for mobile agents: A two-level architecture

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1686, Issue , 1999, Pages 1-31

  Sewell, Peter ^a   Wojciechowski, Paweł T ^a   Pierce, Benjamin C ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER PROGRAMMING; ENCODING (SYMBOLS); LOCATION; SEMANTICS;

COMMUNICATION PRIMITIVES; DISTRIBUTED INFRASTRUCTURE; ENCODINGS; IMPLEMENTATION STRATEGIES; LOCATION DEPENDENTS; LOCATION INDEPENDENT; SOLID BASIS;

MOBILE AGENTS;

EID: 84957042631     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47959-7_1     Document Type: Conference Paper

References (34)

1. [ACPP91] Martín Abadi, Luca Cardelli, Benjamin Pierce, and Gordon Plotkin. Dynamic typing in a statically typed language. ACM Transactions on Programming Languages and Systems, 13(2):237–268, April 1991.
2. [AP94] R. M. Amadio and S. Prasad. Localities and failures. In P. S. Thiagarajan, editor, Proceedings of 14th FST and TCS Conference, FST-TCS’94. LNCS 880, pages 205–216. Springer-Verlag, 1994.
3. [AP98] Roberto M. Amadio and Sanjiva Prasad. Modelling IP mobility. In Proceedings of CONCUR ’98: ConcurrencyThe ory. LNCS 1466, pages 301–316, September 1998.
4. [BB92] G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217–248, 1992.
5. [Bou92] Gérard Boudol. Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sofia-Antipolis, May 1992.
6. [Car86] Luca Cardelli. Amber and the amber machine. In Guy Cousineau, Pierre-Louis Curien, and Bernard Robinet, editors, Combinators and Functional Programming Languages, LNCS 242, pages 21–70, 1986.
7. [CG98] Luca Cardelli and Andrew D. Gordon. Mobile ambients. In Proc. Of Foundations of Software Science and Computation Structures (FoSSaCS), ETAPS’98, LNCS 1378, pages 140–155, March 1998.
8. [CHK97] D. Chess, C. Harrison, and A. Kershenbaum. Mobile agents: Are they a good idea? In Mobile Object Systems – Towards the Programmable Internet. LNCS 1222, pages 25–48, 1997.
9. [FGL+96] Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, and Didier Rémy. A calculus of mobile agents. In Proceedings of CONCUR ’96. LNCS 1119, pages 406–421. Springer-Verlag, August 1996.
10. [HR98a] Matthew Hennessy and James Riely. Resource access control in systems of mobile agents. In Workshop on High-Level Concurrent Languages, 1998. Full version as University of Sussex technical report CSTR 98/02.
11. [HR98b] Matthew Hennessy and James Riely. Type-safe execution of mobile agents in anonymous networks. In Workshop on Mobile Object Systems, (satellite of ECOOP ’98), 1998. Full version as University of Sussex technical report CSTR 98/03.
12. [HT91] Kohei Honda and Mario Tokoro. An object calculus for asynchronous communication. In Pierre America, editor, Proceedings of ECOOP ’91, LNCS 512, pages 133–147, July 1991.
13. [JGF96] Simon Peyton Jones, Andrew Gordon, and Sigbjorn Finne. Concurrent Haskell. In Conference Record of the 23rd ACM Symposium on Principles of Programming Languages, pages 295–308, St. Petersburg, Florida, January 21–24, 1996. ACM Press.
14. [Joi98] The join calculus language, 1998. Implementations available from http://pauillac.inria.fr/join/unix/eng.htm.
15. [Lyn96] Nancy A. Lynch. Distributed algorithms. Morgan Kaufmann, 1996.
16. [Mil92] Robin Milner. Functions as processes. Journal of Mathematical Structures in Computer Science, 2(2):119–141, 1992.
17. [MLC98] D. S. Milojicic, W. LaForge, and D. Chauhan. Mobile Objects and Agents (MOA). In USENIX COOTS ’98, Santa Fe, April 1998.
18. [MPW92] R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Parts I + II. Information and Computation, 100(1):1–77, 1992.
19. [Nee89] R. M. Needham. Names. In S. Mullender, editor, Distributed Systems, pages 89–101. Addison-Wesley, 1989.
20. [Obj97] ObjectSpace. Voyager core technology user guide, version 2.0 beta 1. Available from http://www.objectspace.com/, 1997.
21. [PT94] Benjamin C. Pierce and David N. Turner. Concurrent objects in a process calculus. In Theoryand Practice of Parallel Programming (TPPP), Sendai, Japan, November 1994.
22. [PT97] Benjamin C. Pierce and David N. Turner. Pict: A programming language based on the pi-calculus. Technical Report CSCI 476, Computer Science Department, Indiana University, 1997. To appear in Proof, Language and Interaction: Essays in Honour of Robin Milner, Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, MIT Press.
23. [Rep91] John Reppy. CML: A higher-order concurrent language. In Programming Language Design and Implementation, pages 293–259. SIGPLAN, ACM, June 1991.
24. [RH97] James Riely and Matthew Hennessy. Distributed processes and location failures. In Proceedings of ICALP ’97. LNCS 1256, pages 471–481. Springer-Verlag, July 1997.
25. [RH98] James Riely and Matthew Hennessy. A typed language for distributed mobile processes. In Proceedings of the 25th POPL, January 1998.
26. [Sew97a] Peter Sewell. Global/local subtyping for a distributed π-calculus. Technical Report 435, University of Cambridge, August 1997. Available from http://www.cl.cam.ac.uk/users/pes20/.
27. [Sew97b] Peter Sewell. On implementations and semantics of a concurrent programming language. In Proceedings of CONCUR ’97. LNCS 1243, pages 391–405, 1997.
28. [Sew98] Peter Sewell. Global/local subtyping and capability inference for a distributed π-calculus. In Proceedings of ICALP ’98, LNCS 1443, pages 695–706, 1998.
29. [Sew99] Peter Sewell. A brief introduction to applied π, January 1999. Lecture notes for the Mathfit Instructional Meeting on Recent Advances in Semantics and Types for Concurrency: Theory and Practice, July 1998. Available from http://www.cl.cam.ac.uk/users/pes20/.
30. [SWP98] Peter Sewell, PaweLl T. Wojciechowski, and Benjamin C. Pierce. Location independence for mobile agents. In Workshop on Internet Programming Languages, Chicago, May 1998.
31. [SY97] Tatsurou Sekiguchi and Akinori Yonezawa. A calculus with code mobility. In Howard Bowman and John Derrick, editors, Formal Methods for Open Object-based Distributed Systems (Proceedings of FMOODS ’97), pages 21–36. IFIP, Chapman and Hall, July 1997.
32. [TLK96] Bent Thomsen, Lone Leth, and Tsung-Min Kuo. A Facile tutorial. In Proceedings of CONCUR ’96. LNCS 1119, pages 278–298. Springer-Verlag, August 1996.
33. [Tur96] David N. Turner. The Polymorphic Pi-calculus: Theory and Implementation. PhD thesis, University of Edinburgh, 1996.
34. [VC98] Jan Vitek and Guiseppe Castagna. Towards a calculus of mobile computations. In Workshop on Internet Programming Languages, Chicago, May 1998.