Article contents
Types for ambient and process mobility†
Published online by Cambridge University Press: 01 April 2008
Abstract
We present a new kind of ambient calculus in which the open capability is replaced by direct mobility of generic processes. The calculus comes equipped with a labelled transition system in which types play a major role: this system allows us to show interesting algebraic laws. As usual, types express the communication, access and mobility properties of the modelled system, and inferred types express the minimal constraints required for the system to be well behaved.
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2008
References
Amtoft, T., Kfoury, A. J. and Pericas-Geertsen, S. M. (2001) What are Polymorphically-Typed Ambients? In: Sands, D. (ed.) ESOP'01. Springer-Verlag Lecture Notes in Computer Science 2028 206–220.CrossRefGoogle Scholar
Amtoft, T., Makholm, H. and Wells, J. B. (2004) PolyA: True Type Polymorphism for Mobile Ambients. In: Lévy, J.-J., Mayr, E. W. and Mitchell, J. C. (eds.) TCS'04, Kluwer Academic Publishers 5971–611.Google Scholar
Barbanera, F.Dezani-Ciancaglini, M.Salvo, I. and Sassone, V. (2002) A Type Inference Algorithm for Secure Ambients. In: Lenisa, M. and Miculan, M. (eds.) TOSCA'01. Electronic Notes in Theoretical Computer Science 62 83–101.CrossRefGoogle Scholar
Bettini, L., Bono, V.DeNicola, R. Nicola, R.Ferrari, G.Gorla, D.Loreti, M.Moggi, E.Pugliese, R.Tuosto, E. and Venneri, B. (2003) The Klaim Project: Theory and Practice. In: Priami, C. (ed.) Global Computing. Springer-Verlag Lecture Notes in Computer Science 2874 88–150.CrossRefGoogle Scholar
Bugliesi, M. and Castagna, G. (2002) Behavioral Typing for Safe Ambients. Computer Languages 28 (1)61–99.Google Scholar
Bugliesi, M., Castagna, G. and Crafa, S. (2004) Access Control for Mobile Agents: The Calculus of Boxed Ambients. ACM Transactions on Programming Languages and Systems 26 (1)57–124.CrossRefGoogle Scholar
Bugliesi, M., Crafa, S., Merro, M. and Sassone, V. (2005) Communication and Mobility Control in Boxed Ambients. Information and Computation 202 (1)39–86.CrossRefGoogle Scholar
Cardelli, L., Ghelli, G. and Gordon, A. D. (1999) Mobility Types for Mobile Ambients. In: Wiederman, J., van Emde Boas, P. and Nielsen, M. (eds.) ICALP'99. Springer-Verlag Lecture Notes in Computer Science 1644 230–239.CrossRefGoogle Scholar
Cardelli, L., Ghelli, G. and Gordon, A. D. (2002) Types for the Ambient Calculus. Information and Computation 177 (2)160–194.CrossRefGoogle Scholar
Cardelli, L. and Gordon, A. D. (1999) Types for Mobile Ambients. In: Aiken, A. (ed.) POPL'99, ACM Press 79–92.CrossRefGoogle Scholar
Cardelli, L. and Gordon, A. D. (2000) Mobile Ambients. Theoretical Computer Science 240 (1)177–213. (Special Issue on Coordination, Le Métayer, D. (ed.).)CrossRefGoogle Scholar
Coppo, M., Cozzi, F.Dezani-Ciancaglini, M.Giovannetti, E. and Pugliese, R. (2005) A Mobility Calculus with Local and Dependent Types. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F. and de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. Springer-Verlag Lecture Notes in Computer Science 3838 404–444.CrossRefGoogle Scholar
Coppo, M.Dezani-Ciancaglini, M.Giovannetti, E. and Pugliese, R. (2004) Dynamic and Local Typing for Mobile Ambients. In: Lévy, J.-J.Mayr, E. W. and Mitchell, J. C. (eds.) TCS'04, Kluwer Academic Publishers 583–596.Google Scholar
Coppo, M.Dezani-Ciancaglini, M.Giovannetti, E. and Salvo, I. (2003) M3: Mobility Types for Mobile Processes in Mobile Ambients. In: Harland, J. (ed.) CATS 2003. Electronic Notes in Theoretical Computer Science 78 1–34.CrossRefGoogle Scholar
Cozzi, F. (2004) Type Inference for Local Typing of Mobile Ambients. (Available at http://homelinux.capitano.unisi.it/cozzif/.)Google Scholar
De Nicola, R.Ferrari, G. and Pugliese, R. (1998) Klaim: a Kernel Language for Agents Interaction and Mobility. IEEE Transactions on Software Engineering 24 (5)315–330.CrossRefGoogle Scholar
Giovannetti, E. (2003) Ambient Calculi with Types: a Tutorial. In: Priami, C. (ed.) Global Computing. Springer-Verlag Lecture Notes in Computer Science 2874 151–191.CrossRefGoogle Scholar
Giovannetti, E. (2004) Type Inference for Mobile Ambients in Prolog. In: Atkinson, M. (ed.) CATS'04. Electronic Notes in Theoretical Computer Science 91 96–115.CrossRefGoogle Scholar
Hennessy, M. and Riely, J. (2002) Resource Access Control in Systems of Mobile Agents. Information and Computation 173 82–120.CrossRefGoogle Scholar
Hindley, J. (1969) The Principal Type Scheme of an Object in Combinatory Logic. Transactions of the American Mathematical Society 146 29–60.Google Scholar
Honsell, F. and Scagnetto, I. (2004) Mobility Types in Coq. In: Berardi, S., Coppo, M. and Damiani, F. (eds.) TYPES'03. Springer-Verlag Lecture Notes In Computer Science 3085 324–337.CrossRefGoogle Scholar
Kahn, G. (1987) Natural Semantics. In: Brandenburg, F.-J., Vidal-Naquet, G. and Wirsing, M. (eds.) STACS'87. Springer-Verlag Lecture Notes in Computer Science 247 22–39.CrossRefGoogle Scholar
Levi, F. and Sangiorgi, D. (2003) Controlling Interference in Ambients. Transactions on Programming Languages and Systems 25 (1)1–69.CrossRefGoogle Scholar
Lhoussaine, C. and Sassone, V. (2004) A Dependently Typed Ambient Calculus. In: Schmidt, D. A. (ed.) ESOP'04. Springer-Verlag Lecture Notes in Computer Science 2986 171–187.CrossRefGoogle Scholar
Merro, M. and Hennessy, M. (2002) Bisimulation Congruences in Safe Ambients. In: Mitchell, J. (ed.) POPL'02, ACM Press 71–80.CrossRefGoogle Scholar
Merro, M. and Sassone, V. (2002) Typing and Subtyping Mobility in Boxed Ambients. In: Brim, L., Jančar, P., Ketínsk, M. and Kučera, A. (eds.) CONCUR'02. Springer-Verlag Lecture Notes in Computer Science 2421 304–320.CrossRefGoogle Scholar
Merro, M. and Zappa Nardelli, F. (2005) Behavioural Theory for Mobile Ambients. Journal of the ACM 50 (6)961–1023.CrossRefGoogle Scholar
Milner, R. (1993) The Polyadic π-Calculus: A Tutorial. In: Bauer, F. L., Brauer, W. and Schwichtenberg, H. (eds.) Logic and Algebra of Specification. NATO ASI Series F: Computer and Systems Sciences 94 203–246.Google Scholar
Milner, R., Parrow, J. and Walker, D. (1992) A Calculus of Mobile Processes, Parts 1-2. Information and Computation 100 (1)1–77.CrossRefGoogle Scholar
Milner, R. and Sangiorgi, D. (1992) Barbed Bisimulation. In: Kuich, W. (ed.) ICALP'92. Springer-Verlag Lecture Notes in Computer Science 623 685–695.CrossRefGoogle Scholar
Pierce, B. and Sangiorgi, D. (1996) Typing and Subtyping for Mobile Processes. Mathematical Structures in Computer Science 6 (5)409–454.CrossRefGoogle Scholar
Pierce, B. and Sangiorgi, D. (2000) Behavioral Equivalence in the Polymorphic pi-calculus. Journal of the ACM 47 (3)531–584.CrossRefGoogle Scholar
Sangiorgi, D. and Milner, R. (1992) The Problem of “Weak Bisimulation up to”. In: Cleaveland, W. R. (ed.) CONCUR'92. Springer-Verlag Lecture Notes in Computer Science 630 32–46.CrossRefGoogle Scholar
Sangiorgi, D. and Valente, A. (2001) A Distributed Abstract Machine for Safe Ambients. In: Orejas, F., Spirakis, P. and Leeuwen, J. (eds.) ICALP'01. Springer-Verlag Lecture Notes in Computer Science 2076 408–420.CrossRefGoogle Scholar
Sangiorgi, D. and Walker, D. (2001) The π-calculus: a Theory of Mobile Processes, Cambridge University Press.Google Scholar
Wells, J. (2002) The Essence of Principal Typings. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbez, S. and Conejo, R. (eds.) ICALP'02. Springer-Verlag Lecture Notes in Computer Science 2380 913–925.CrossRefGoogle Scholar
Zimmer, P. (2000) Subtyping and Typing Algorithms for Mobile Ambients. In: Tiuryn, J. (ed.) FoSSaCS'00. Springer-Verlag Lecture Notes in Computer Science 1784 375–390.CrossRefGoogle Scholar
- 3
- Cited by