Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-26T09:07:08.822Z Has data issue: false hasContentIssue false
  • English
  • Français

Boxed ambients with communication interfaces†

Published online by Cambridge University Press:  01 August 2007

PABLO GARRALDA ,
EDUARDO BONELLI ,
ADRIANA COMPAGNONI  and
MARIANGIOLA DEZANI-CIANCAGLINI
PABLO GARRALDA
Affiliation:
Stevens Institute of Technology, Computer Science Department, Castle Point on Hudson, Hoboken, NJ 07030, U.S.A. Email: abc@cs.stevens.edu
EDUARDO BONELLI
Affiliation:
Universidad Nacional de La Plata and CONICET, Facultad de Informática, LIFIA, Calle 115 entre 49 y 50, 1900 La Plata, Buenos Aires, Argentina
ADRIANA COMPAGNONI
Affiliation:
Stevens Institute of Technology, Computer Science Department, Castle Point on Hudson, Hoboken, NJ 07030, U.S.A. Email: abc@cs.stevens.edu
MARIANGIOLA DEZANI-CIANCAGLINI
Affiliation:
Università di Torino, Dipartimento di Informatica, Corso Svizzera, 185, 10149 Torino, Torino, Italy
Get access Rights & Permissions [Opens in a new window]

Abstract

We define BACI(Boxed Ambients with Communication Interfaces), an ambientcalculus with a flexible communication policy. Traditionally, typed ambientcalculi have a fixed communication policy determining the kind of informationthat can be exchanged with a parent ambient, even though mobility changes theparent. BACI lifts that restriction, allowing differentcommunication policies with different parents during computation. Furthermore,BACI separates communication and mobility by making thechannels of communication between ambients explicit. In contrast with othertyped ambient calculi where communication policies are global, each ambient inBACI is equipped with a description of the communicationpolicies ruling its information exchange with parent and child ambients. Thecommunication policies of ambients increase when they move: more precisely, whenan ambient enters another ambient, the entering ambient and the host ambient canexchange their communication ports and agree on the kind of information to beexchanged. This information is recorded locally in both ambients.

We show the type-soundness of BACI, proving that it satisfies thesubject reduction property, and we study its behavioural semantics by means of alabelled transition system.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 17 , Issue 4 , August 2007 , pp. 587 - 645
Copyright
Copyright © Cambridge University Press 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

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 591–604.Google Scholar
Barbanera, F., Bugliesi, M., Dezani-Ciancaglini, M. and Sassone, V. (2003) A Calculus of Bounded Capacities. In: Saraswat, V. A. (ed.) ASIAN'03. Springer-Verlag Lecture Notes in Computer Science 2896 205–223.CrossRefGoogle Scholar
Bonelli, E., Compagnoni, A. and Gunter, E. (2005) Correspondence Assertions for Process Synchronization in Concurrent Communications. Journal of Functional Programming 15 (2)219–248.CrossRefGoogle Scholar
Bonelli, E., Compagnoni, A. B., Dezani-Ciancaglini, M. and Garralda, P. (2004) Boxed Ambients with Communication Interfaces. In: Fiala, J., Koubek, V. and Kratochvíl, J. (eds.) MFCS'04. Springer-Verlag Lecture Notes in Computer Science 3153 119–148.CrossRefGoogle Scholar
Boudol, G. (2003) A Parametric Model of Migration and Mobility, Release 1. Mikado Deliverable D1.2.1. (Available at http://mikado.di.fc.ul.pt/repository/D1.2.1.pdf)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. (2002) Types for the Ambient Calculus. Information and Computation 177 (2)160–194.CrossRefGoogle Scholar
Cardelli, L. and Gordon, A. D. (2000) Mobile Ambients. Theoretical Computer Science 240 (1) (Special Issue on Coordination) 177–213.CrossRefGoogle Scholar
Castagna, G., Vitek, J. and Nardelli, F. Z. (2005) The Seal Calculus. Information and Computation 201 (1)1–54.CrossRefGoogle Scholar
Compagnoni, A. and Gunter, E. (2005) Types for Security in a Mobile World. In: Nicola, R. D. and Sangiorgi, D. (eds.) TGC 2005. Springer-Verlag Lecture Notes in Computer Science 3705 75–97.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 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'03. Electronic Notes in Theoretical Computer Science 78Google 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
Dezani-Ciancaglini, M., Mostrous, D., Yoshida, N. and Drossopoulou, S. (2006) Session Types for Object-Oriented Languages. In: Thomas, D. (ed.) ECOOP'06. Springer-Verlag Lecture Notes in Computer Science 4067 328–352.CrossRefGoogle Scholar
Garralda, P. and Compagnoni, A. (2005) Splitting Mobility and Communication in Boxed Ambients. In: Fernández, M. and Mackie, I. (eds.) DCM 2005. Electronic Notes in Theoretical Computer Science 135 105–114.Google Scholar
Garralda, P., Compagnoni, A. and Dezani-Ciancaglini, M. (2006) BASS: Boxed Ambients with Safe Sessions. In: Maher, M. (ed.) PPDP'06, ACM Press 61–72.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
Goguen, H. (1995) Typed Operational Semantics. In: Dezani-Ciancaglini, M. and Plotkin, G. (eds.) TLCA'95. Springer-Verlag Lecture Notes in Computer Science 902 186–200.CrossRefGoogle Scholar
Goguen, H. (1999) Soundness of a Typed Operational Semantics for the Logical Framework. In: Girard, J.-Y. (ed.) TLCA'99. Springer-Verlag Lecture Notes in Computer Science 1581 177–197.CrossRefGoogle Scholar
Gordon, A. D. and Cardelli, L. (2003) Equational Properties of Mobile Ambients. Mathematical Structures in Computer Science 13 (3)371–408.CrossRefGoogle Scholar
Hennessy, M., Merro, M. and Rathke, J. (2004) Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. Theoretical Computer Science 322 (3)615–669.CrossRefGoogle Scholar
Hennessy, M. and Riely, J. (2002) Resource Access Control in Systems of Mobile Agents. Information and Computation 173 82–120.CrossRefGoogle Scholar
Hennessy, M. and Riely, J. (2003) Trust and Partial Typing in Open Systems of Mobile Agents. Journal of Automated Reasoning 31 (3-4)335–370.Google Scholar
Honda, K., Vasconcelos, V. T. and Kubo, M. (1998) Language Primitives and Type Disciplines for Structured Communication-based Programming. In: Hankin, C. (ed.) ESOP'98. Springer-Verlag Lecture Notes in Computer Science 1381 22–138.Google Scholar
Honda, K. and Yoshida, N. (1994) Replication in Concurrent Combinators. In: Hagiya, M. and Mitchell, J. C. (eds.) TACS'94. Springer-Verlag Lecture Notes in Computer Science 789 786–805.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. (ed.) ESOP'04. Springer-Verlag Lecture Notes in Computer Science 2986 171–187.CrossRefGoogle Scholar
Merro, M. and Hennessy, M. (2006) Bisimulation Congruences in Safe Ambients. ACM Transactions on Programming Languages and System. 28 (2)290–330.CrossRefGoogle Scholar
Merro, M. and Sassone, V. (2002) Typing and Subtyping Mobility in Boxed Ambients. In: Brim, L., Jancar, P., Kretinsky, M. and Kucera, A. (eds.) CONCUR'02. Springer-Verlag Lecture Notes in Computer Science 2421 304–320.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, Springer-Verlag 94 203–246.Google 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
Necula, G. C. (1997) Proof-Carrying Code. In: Jones, N. D. (ed.) POPL'97, ACM Press 106–119.CrossRefGoogle Scholar
Sangiorgi, D. and Walker, D. (2002) The π-calculus, Cambridge University Press.Google Scholar
Teller, D., Zimmer, P. and Hirschkoff, D. (2002) Using Ambients to Control Resources. In: Brim, L., Janĉar, P., Kretínskûy, M. and Kuĉera, A. (eds.) CONCUR'02. Springer-Verlag Lecture Notes in Computer Science 2421 288–303.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