The Seal Calculus

Information and Computation

Volumn 201, Issue 1, 2005, Pages 1-54

  Castagna, G ^a   Vitek, J ^b   Nardelli, F Zappa ^c  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b Purdue University   (United States)

^c INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SIMULATION; TREES (MATHEMATICS);

HIGH-ORDER COMMUNICATIONS; PROCESS LANGUAGE; SEAL CALCULUS; TRANSITION SYSTEMS;

MOBILE COMPUTING;

EID: 23144461963     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.11.005     Document Type: Article

References (67)

1. R.M. Amadio, An asynchronous model of locality, failure, and process mobility, in: Proceedings of COORDINATION '97, Springer-Verlag, 1997, Full version as Rapport Interne, LIM Marseille, and Rapport de Recherche RR-3109, INRIA Sophia-Antipolis, 1997.
2. W. Binder J-SEAL2: a secure high-performance mobile agent system Electronic Commerce Research 1 1/2 2001 131 148
3. B. Blanchet, B. Aziz, A calculus for secure mobility, in: Eighth Asian Computing Science Conference (ASIAN'03), Mumbai, India, Dec. 2003, pp. 188-204.
4. C. Bryce, and J. Vitek The JavaSeal mobile agent kernel Autonomous Agents and Multi-Agent Systems 4 4 2001 359 384
5. M. Bugliesi, and G. Castagna Secure safe ambients Proc. of POPL'01 2001 ACM Press New York 222 235
6. M. Bugliesi, G. Castagna, and S. Crafa Boxed ambients TACS'01 Lecture Notes in Computer Science vol. 2215 2001 Springer-Verlag Berlin 38 63
7. M. Bugliesi, G. Castagna, and S. Crafa Reasoning about security in mobile asmbients CONCUR'01 Lecture notes in computer science vol. 2154 2001 Springer-Verlag Berlin 102 120
8. M. Bugliesi, S. Crafa, M. Merro, V. Sassone, Communication interference in mobile boxed ambients, in: FST&TCS '02, 22th Conference on the Foundations of Software Technology and Theoretical Computer Science, Springer, Dec. 2002, pp. 85-96. Extended version available from: < http://www.cogs.susx.ac.uk/users/vs/research/paps/nba-subm.ps.gz>.
9. L. Cardelli A language with distributed scope Computing Systems 8 1 1995 27 59
10. L. Cardelli, and A. Gordon Mobile ambients Proceedings of F0SSaCS'98 Lecture notes in computer science vol. 1378 2001 Springer-Verlag Berlin 140 155
11. L. Cardelli, and A. Gordon Equational properties for mobile ambients Proceedings FoSSaCS '99 Lecture notes in computer science 1999 Springer-Verlag Berlin
12. L. Cardelli, and A. Gordon Types for mobile ambients Proceedings of POPL '99 1999 ACM Press New York 79 92
13. L. Cardelli, A. Gordon, A commitment relation for the Ambient Calculus, Oct. 2000. Available from: < http://research.microsoft.com/~/adg/Publications/ambient-commitment.pdf>.
14. L. Cardelli, G. Ghelli, and A. Gordon Mobility types for mobile ambients Proceedings of ICALP '99 Lecture notes in computer science vol. 1644 1999 Springer-Verlag Berlin 230 239
15. L. Cardelli, G. Ghelli, and A.D. Gordon Ambient groups and mobility types International conference IFIP TCS Lecture notes in computer science vol. 1872 2000 Springer-Verlag Berlin 333 347
16. G. Castagna, G. Ghelli, and F. Zappa Nardelli Typing mobility in the seal calculus CONCUR'01 Lecture notes in computer science vol. 2154 2001 Springer-Verlag Berlin 82 101
17. G. Castagna, and F. Zappa Nardelli The seal calculus revisited: contextual equivalence and bisimilarity FST&TCS '02, 22th conference on the foundations of software technology and theoretical computer science 2002 Springer 85 96
18. S. Crafa, M. Bugliesi, and G. Castagna Information flow security for Boxed Ambients Foundations of wide area network computing (F-WAN) 2002 Elsevier Science B.V.
19. R. De Nicola, G. Ferrari, and R. Pugliese Coordinating mobile agents via blackboards and access rights Proceedings of COORDINATION'97 1997 Springer-Verlag Berlin
20. R. De Nicola, G. Ferrari, and R. Pugliese Locality based Linda: programming with explicit localities Proceedings of FASE-TAPSOFT'97 1997 Springer-Verlag Berlin
21. G. Ferrari, U. Montanari, E. Tuosto, A LTS semantics of ambients via graph synchronization with mobility, in: Proceedings ICTCS, Lecture Notes in Computer Science, vol. 2202, 2001.
22. C. Fournet, G. Gonthier, The reflexive chemical abstract machine and the join-calculus, in: Proceedings of POPL'96, pp. 372-385.
23. C. Fournet, G. Gonthier, J. Lévy, L. Maranget, and D. Rémy A calculus of mobile agents Seventh international conference on concurrency theory (CONCUR '96) Lecture Notes in Computer Science vol. 1119 1996 Springer-Verlag 406 421
24. C. Fournet, J.-J. Levy, and A. Schmitt An asynchronous, distributed implementation of mobile ambients International conference IFIP TCS Lecture Notes in Computer Science vol. 1872 2000 Springer-Verlag
25. D. Gelernter Generative communication in Linda ACM Transactions on Programming Languages and Systems 7 1 1985 80 112
26. J.C. Godskesen, T. Hildebrandt, and V. Sassone A calculus of mobile resources CONCUR 2002 (13th international conference on concurrency theory) Lecture Notes in Computer Science 2002 Springer Berlin
27. R.S. Gray, Agent Tcl: A flexible and secure mobile-agent system. Technical Report PCS-TR98-327, Dartmouth College, Computer Science, Hanover, NH, Jan. 1998.
28. M. Hennessy, M. Merro, and J. Rathke Towards a behavioural theory of access and mobility control in distributed system Proc. 5th FoSSaCS '03 Lecture notes in computer science 2003 Springer Verlag Berlin
29. M. Hennessy, and J. Riely Type-safe execution of mobile agents in anonymous networks Internet programming languages Lecture notes in computer science vol. 1686 1999 Springer-Verlag Berlin
30. M. Hennessy, and J. Riely Resource access control in systems of mobile agents Information and Computation 173 2002 82 120
31. M. Hennessy, J. Rathke, N. Yoshida, Safedpi: a language for controlling mobile code, in: Proc. FOSSACS 03, Lecture Notes in Computer Science, vol. 2620, 2003.
32. M. Hicks, P. Kakkar, J.T. Moore, C.A. Gunter, S. Nettles, PLAN: A packet language for active networks, in: Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming Languages, ACM, 1998, pp. 86-93. Available from: < www.cis.upenn.edu/~switchware/papers/plan.ps>.
33. K. Honda, and N. Yoshida On reduction-based process semantics Theoretical Computer Science 152 2 1995 437 486
34. K. Honda, and N. Yoshida On reduction-based process semantics Theoretical Computer Science 152 2 1995 437 486
35. E. Jul, H. Levy, N. Hutchinson, A. Black, Fine-grained mobility in the emerald system,in: Proceedings of the 11th ACM Symposium on Operating Systems Principles, Nov. 1987, pp. 62-74.
36. F. Levi, and D. Sangiorgi Controlling interference in ambients POPL '00 2000 ACM Press 352 364
37. M. Merro, Locality in the π-calculus and applications to distributed objects, PhD thesis, École de Mines de Paris, October 2000.
38. M. Merro, and M. Hennessy Bisimulation conguences in safe ambients POPL'02 2002 ACM Press New York 71 80
39. M. Merro, F. Zappa Nardelli, Bisimulation proof methods for mobile ambients, in: ICALP '03, LNCS 2003.
40. An extended version is available as COGS Computer Science Report 2003:01.
41. R. Milner, The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, UK, Oct. 1991, in: F.L. Bauer, W. Brauer, H. Schwichtenberg, (Ed.), Proceedings of the International Summer School on Logic and Algebra of Specification, Marktoberdorf, August 1991.
42. Reprinted in Logic and Algebra of Specification, Springer-Verlag, 1993.
43. R. Milner, J. Parrow, and D. Walker A calculus of mobile processes, Parts I and II Information and Computation 100 1992 1 77
44. R. Milner, and D. Sangiorgi Barbed bisimulation Proc. ICALP 92 Lecture notes in computer science 1992 Springer Verlag Berlin 685 695
45. F. Nielson, H. Riis Nielson, R.R. Hansen, and J.G. Jensen Validating firewalls in mobile ambients Proc. CONCUR '99 Lecture notes in computer science vol. 1664 1999 Springer-Verlag 463 477
46. P. Pardyak, S. Savage, B.N. Bershad, Language and runtime support for dynamic interposition of system code, Unpublished manuscript, Nov. 1995.
47. J. Riely, M. Hennessy, Distributed processes and location failures, in: Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela (Eds.), Proceedings of ICALP '97, Lectures Notes in Computer Science, vol. 1256, Springer-Verlag, 1997, pp. 471-481. Full version as Report 2/97, University of Sussex, Brighton.
48. J. Riely, and M. Hennessy A typed language for distributed mobile processes Proceedings of POPL'98 1998 ACM Press New York 378 390
49. D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, PhD thesis CST-99-93, Department of Computer Science, University of Edinburgh, 1992.
50. D. Sangiorgi Bisimulation for higher-order process calculi Information and Computation 131 2 1996 141 178
51. D. Sangiorgi, Extensionality and intensionality of the ambient logic, in: Proceedings of the 28th ACM Symposium on Principles of Programming Languages, London, ACM Press, New York, 2001.
52. D. Sangiorgi, and D. Walker The π-Calculus 2002 Cambridge University Press Cambridge
53. P. Sewell Global/local subtyping and capability inference for a distributed π-calculus K.G. Larsen S. Skyum G. Winskel Proceedings if ICALP '98 Lecture notes in computer science vol. 1443 1998 Springer-Verlag Berlin
54. P. Sewell, Applied π-a brief tutorial. Technical Report 498, Computer Laboratory, University of Cambridge, 2000.
55. P. Sewell, J. Vitek, Secure composition of insecure components, in: 12th IEEE Computer Security Foundations Workshop, 1999.
56. P. Sewell, J. Vitek, Composition of untrusted code: wrappers and causality types, Journal of Computer Security, 11(2) (2003) (in press).
57. P. Sewell, P. Wojciechowski, B. Pierce, Location independence for mobile agents, in: Proceedings of the 1998 Workshop on Internet Programming Languages, Chicago, Ill., May 1998.
58. D. Tennenhouse, Active networks, in: USENIX, editor, 2nd Symposium on Operating Systems Design and Implementation (OSDI '96), October 28-31, 1996. Seattle, WA, Berkeley, CA, USA, Oct. 1996. USENIX.
59. B. Thomsen Plain CHOCS. A second generation calculus for higher order processes Acta Informatica 30 1 1993 1 59
60. A. Unyapoth, and P. Sewell Nomadic Pict: correct communication infrastructures for mobile computation Proc. 28th POPL 2001 ACM Press New York
61. M.G. Vigliotti, Transition systems for the ambient calculus, Master thesis, Imperial College of Science, Technology and Medicine (University of London). Sep. 1999.
62. J. Vitek, The Seal model of Mobile Computations, PhD thesis, University of Geneva, 1999.
63. J. Vitek, and G. Castagna Seal: a framework for secure mobile computations Internet programming languages Lecture notes in computer science vol. 1686 1999 Springer-Verlag Berlin 47 77
64. J. Waldo, G. Wyant, A. Wollrath, and S. Kendall A note on distributed computing J. Vitek C. Tschudin Mobile object systems: towards the programmable internet 1997 Springer-Verlag Berlin
65. J. White, Mobile agents white paper. General Magic, 1996. Available from: < http://www.generalmagic.com>.
66. N. Yoshida, M. Hennessy, Assigning types to processes, in: Proceedings, Fifteenth Annual IEEE Symposium on Logic in Computer Science, 2000, pp. 334-348.
67. F. Zappa Nardelli, De la sémantique des processus d'ordre supérieur, PhD thesis, U. Paris 7, 2003.