A bisimulation-based semantic theory of Safe Ambients

ACM Transactions on Programming Languages and Systems

Volumn 28, Issue 2, 2006, Pages 290-330

  Merro, Massimo ^a   Hennessy, Matthew ^b  

^a UNIVERSITY OF VERONA   (Italy)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

Bisimulation; Distributed systems; Mobile agents

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; INFORMATION THEORY; MOBILE COMPUTING; RESOURCE ALLOCATION;

BISIMULATION; DISTRIBUTED SYSTEMS; MOBILE AGENTS; OPERATIONAL SEMANTICS;

SEMANTICS;

EID: 33745389061     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1119479.1119482     Document Type: Article

References (44)

1. AMADIO, R., CASTELLANI, I., AND SANGIORGI, D. 1998. On bisimulations for the asynchronous π-calculus. Theoretical Computer Science 195, 291-324.
2. BUGLIESI, M., CASTAGNA, G., AND CRAFA, S. 2001. Boxed ambients. In Proceedings of the 4th TACS. LNCS, vol. 2215. Springer Verlag.
3. BUGLIESI, M., CRAFA, S., MERRO, M., AND SASSONE, V. 2005. Communication interference in mobile boxed ambients. J. Information and Computation 202(1).
4. An extended abstract appeared in Proceedings of FSTTCS'02, LNCS, Springer Verlag.
5. CARDELLI, L. AND GORDON, A. 1996. A commitment relation for the ambient calculus. Unpublished notes.
6. CARDELLI, L. AND GORDON, A. 2000. Mobile ambients. Theoretical Computer Science 240, 1, 177-213.
7. An extended abstract appeared in Proceedings of the FoSSaCS '98.
8. CARDELLI, L. AND GORDON, A. D. 1999. Types for mobile ambients. In Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, 79-92.
9. CASTAGNA, G. AND ZAPPA NARDELLI, F. 2002. The seal calculus revisited: Contextual equivalence and bisimilarity. In Proceedings of the 22nd FSTTCS '02. LNCS, vol. 2556. Springer Verlag.
10. FERRARI, G., MONTANARI, U., AND TUOSTO, E. 2001. A LTS semantics of ambients via graph synchronization with mobility. In Proceedings of ICTCS. LNCS, vol. 2202. Springer Verlag.
11. GODSKESEN, J., HILDEBRANDT, T., AND SASSONE, V. 2002. A calculus of mobile resources. In Proceedings of the 10th CONCUR '02. LNCS, vol. 2421. Springer Verlag.
12. GORDON, A. D. AND CARDELLI, L. 2002. Equational properties of mobile ambients. J. Math. Struct. Comput. Sci. 12, 1-38.
13. An extended abstract appeared in Proceedings of FoSSaCs '99.
14. HENNESSY, M., MERRO, M., AND RATHKE, J. 2003. Towards a behavioural theory of access and mobility control in distributed system. In Proceedings of the 5th FoSSaCS '03. LNCS. Springer Verlag.
15. HENNESSY, M., RATHKE, J., AND YOSHIDA, N. 2003. Safedpi: A language for controlling mobile code. Computer Science Report 2003:02, University of Sussex.
16. An extended abstract appeared in the Proceedings of FOSSACS'04, volume 2987, Lecture Notes in Computer Science. Springer-Verlag 2004.
17. HENNESSY, M. AND RIELY, J. 1998. A typed language for distributed mobile processes. In Proceedings of the 25th POPL. ACM Press.
18. HONDA, K. AND YOSHIDA, N. 1994. Replication in Concurrent Combinators. In Proceedings of TACS'94. LNCS, vol. 789. Springer Verlag.
19. HONDA, K. AND YOSHIDA, N. 1995. On reduction-based process semantics. Theoretical Computer Science 152, 2, 437-486.
20. JENSEN, O. H. AND MILNER, R. 2004. Bigraphs and mobile processes (revised). Tech. Rep. 580, LFCS, Dept. of Comp. Sci., Edinburgh Univ. Feb.
21. An extended abstract appeared in Conference Record of the 30th Symposium on Principles of Programming Languages, ACM Press, 2003.
22. LEIFER, J. J. AND MILNER, R. 2000. Deriving bisimulation congruences for reactive systems. In CONCUR 2000 - Concurrency Theory, 11th International Conference, University Park, PA, USA, August 22-25, 2000, Proceedings. LNCS, vol. 1877. Springer-Verlag, 243-258.
23. LEVI, F. AND SANGIORGI, D. 2000. Controlling interference in ambients. An extended abstract appeared in Proceedings of the 27th Symposium on Principles of Programming Languages, ACM Press.
24. MERRO, M. AND HENNESSY, M. 2002. Bisimulation congruences in safe ambients. In Proceedings of the 29th POPL '02. ACM Press.
25. MERRO, M. AND ZAPPA NARDELLI, F. 2005. Behavioural theory for mobile ambients. J. ACM 52, 6, 961-1023.
26. MILNER, R. 1989. Communication and Concurrency, Prentice Hall.
27. MILNER, R. 1991. The polyadic π-calculus: a tutorial. Tech. Rep. ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ. Oct.
28. Also in Logic and Algebra of Specification, ed. F. L. Bauer, W. Brauer and H. Schwichtenberg, Springer Verlag, 1993.
29. MILNER, R., PARROW, J., AND WALKER, D. 1992. A calculus of mobile processes, (Parts I and II). Information and Computation 100, 1-77.
30. MILNER, R. AND SANGIORGI, D. 1992. Barbed bisimulation. In Proceedings of the 19th ICALP. LNCS, vol. 623. Springer Verlag, 685-695.
31. PHILLIPS, A. 2005. The channel ambient calculus: From process algebra to mobile code. Ph.D. thesis, Imperial College London.
32. PHILLIPS, A., YOSHIDA, N., AND EISENBACH, S. 2004. A distributed abstract machine for boxed ambient calculi. In Proceedings of ESOP. LNCS, vol. 2987. Springer Verlag.
33. SANGIORGI, D. 1992. Expressing mobility in process algebras: First-order and higher-order paradigms. Ph.D. thesis, Department of Computer Science, University of Edinburgh.
34. SANGIORGI, D. 1994. The lazy lambda calculus in a concurrency scenario. Information and Computation 111, 1, 120-153.
35. SANGIORGI, D. 1996. Bisimulation for Higher-Order Process Calculi. Information and Computation 131, 2, 141-178.
36. SANGIORGI, D. 2001. Extensionality and intensionality of the ambient logic. In Proceedings of the 28th POPL. ACM Press.
37. SANGIORGI, D. AND MILNER, R. 1992. The problem of "Weak Bisimulation up to". In Proceedings of CONCUR '92. LNCS, vol. 630. Springer Verlag, 32-46.
38. SANGIORGI, D. AND WALKER, D. 2001a. The π-calculus: a Theory of Mobile Processes. Cambridge University Press.
39. SANGIORGI, D. AND WALKER, D. 2001b. Some results on barbed equivalences in pi-calculus. In Proceedings of CONCUR '01. LNCS, vol. 2154. Springer Verlag.
40. SCHMITT, A. AND STEFANI, J. 2004. The kell calculus: A family of higher-order distributed process calculi. In LNCS. Springer-Verlag. Workshop of Global Computing 2004.
41. UNYAPOTH, A. AND SEWELL, P. 2001. Nomadic Pict: Correct communication infrastructures for mobile computation. In Proceedings of the 28th POPL. ACM Press.
42. VIGLIOTTI, M. G. September 1999. Transition systems for the ambient calculus. Master thesis, Imperial College of Science, Technology and Medicine (University of London).
43. VIGLIOTTI, M. G. AND PHILLIPS, A. 2002. Barbs and congruences for safe mobile ambients. In Electronic Notes in Theoretical Computer Science. Vol. 66. Elsevier.
44. VITEK, J. AND CASTAGNA, G. 1999. Seal: A framework for secure mobile computations. In Internet Programming Languages. Number 1686 in LNCS. Springer Verlag, 47-77.