Towards a behavioural theory of access and mobility control in distributed systems

Theoretical Computer Science

Volumn 322, Issue 3, 2004, Pages 615-669

  Hennessy, Matthew ^a   Merro, Massimo ^b   Rathke, Julian ^a  

^a UNIVERSITY OF SUSSEX   (United Kingdom)

^b UNIVERSITY OF VERONA   (Italy)

Author keywords

Access control; Bisimulations; Capability types; Contextual equivalence; Distributed picalculus; Mobility control

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; COMPUTER SIMULATION; PUBLIC POLICY; THEOREM PROVING;

ACCESS CONTROL; BISIMULATIONS; CAPABILITY TYPES; CONTEXTUAL EQUIVALENCES; DISTRIBUTED PICALCULUS; MOBILITY CONTROL;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 4043116940     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.12.024     Document Type: Conference Paper

References (25)

1. R.M. Amadio, S. Prasad, Modelling IP mobility, in: D. Sangiorgi, R. de Simone (Eds.), CONCUR'98: Concurrency Theory, 9th Internat. Conf., Nice, France, Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, 1998, pp. 301-316.
2. M. Boreale, D. Sangiorgi, Bisimulation in name-passing calculi without matching, in: 13th LICS Conf., IEEE Computer Society Press, Silver Spring, MD, 1998.
3. M. Bugliesi, S. Crafa, M. Merro, V. Sassone, Communication and mobility control in boxed ambients, Information and Computation, to appear, 2004.
4. Cardelli L. A language with distributed scope. Comput. Systems. 8(1):1995;27-59 Short version in Proc. POPL '95; A preliminary version appeared as Report 122, Digital Systems Research, June 1994.
5. Cardelli L. A language with distributed scope. Comput. Systems. 8(1):1995;27-59 Short version in Proc. POPL '95; A preliminary version appeared as Report 122, Digital Systems Research, June 1994.
6. Cardelli L., Gordon A.D. Mobile ambients. Theoret. Comput. Sci. 240(1):2000;177-213.
7. G. Castagna, F.Z. Nardelli, The Seal calculus revisited: contextual equivalences and bisimilarity, in: Proc. FSTTCS, Lecture Notes in Computer Science, Springer, Berlin, 2002.
8. C. Fournet, G. Gonthier, J.-J. Lévy, L. Maranget, D. Rémy, A calculus of mobile agents, in: 7th Internat. Conf. on Concurrency Theory (CONCUR'96), Pisa, Italy, August 26-29, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996, pp. 406-421.
9. Hennessy M. Algebraic Theory of Processes. 1988;The MIT Press, Cambridge, MA.
10. M. Hennessy, J. Rathke, Typed behavioural equivalences for processes in the presence of subtyping, in: J. Harland (Ed.), Electronic Notes in Theoretical Computer Science, Vol. 61, Elsevier Science Publishers, Amsterdam, 2002; Math. Structures Comput. Sci., to appear.
11. M. Hennessy, J. Rathke, Typed behavioural equivalences for processes in the presence of subtyping, in: J. Harland (Ed.), Electronic Notes in Theoretical Computer Science, Vol. 61, Elsevier Science Publishers, Amsterdam, 2002; Math. Structures Comput. Sci., to appear.
12. M. Hennessy, J. Rathke, N. Yoshida, Safedpi: a language for controlling mobile code, Computer Science Report 02:2003, University of Sussex, 2003.
13. Hennessy M., Riely J. Resource access control in systems of mobile agents. Inform. and Comput. 173:2002;82-120.
14. Honda K., Yoshida N. On reduction-based process semantics. Theoret. Comput. Sci. 152(2):1995;437-486.
15. Merro M., Hennessy M. Bisimulation congruences in safe ambients. ACM SIGPLAN Notices. 31(1):2002;71-80.
16. Merro M., Kleist J., Nestmann U. Mobile objects as mobile processes. J. Inform. Comput. 177(2):2002;195-241.
17. M. Merro, F.Z. Nardelli, Bisimulation proof techniques for mobile ambients, in: Proc. 30th Internat. Coll. on Automata, Languages, and Programming (ICALP 2003), Eindhoven, Lecture Notes in Computer Science, Springer, Berlin, 2003.
18. Milner R. Communication and Concurrency. 1989;Prentice-Hall, Englewood Cliffs, NJ.
19. Milner R., Parrow J., Walker D. A calculus of mobile processes (Parts I and II). Inform. and Comput. 100:1992;1-77.
20. Pierce B., Sangiorgi D. Typing and subtyping for mobile processes. Math. Structures Comput. Sci. 6(5):1996;409-454 Extended abstract in LICS '93.
21. Pierce B., Sangiorgi D. Typing and subtyping for mobile processes. Math. Structures Comput. Sci. 6(5):1996;409-454 Extended abstract in LICS '93.
22. P. Sewell, Global/local subtyping and capability inference for a distributed pi-calculus, in: ICALP 98, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998.
23. A. Unypoth, P. Sewell, Nomadic pict: correct communication infrastructure for mobile computation, in: Conf. Record of POPL'01: The 28th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, London, United Kingdom, January 17-19, 2001, pp. 236-247.
24. J. Vitek, G. Castagna, A calculus of secure mobile computations, in: Secure Internet Programming: Security Issues for Distributed and Mobile Objects, Lecture Notes in Computer Science, Vol. 1603, Springer, Berlin, 1999.
25. Yoshida N., Hennessy M. Assigning types to processes. Inform. and Comput. 172:2002;82-120.