Types for the Ambient Calculus

The ambient calculus is a concurrent calculus where the unifying notion of ambient is used to model many different constructs for distributed and mobile computation. We study a type system that describes several properties of ambient behavior. The type system allows ambients to be partitioned in disjoint sets (groups), according to the intended design of a system, in order to specify both the communication and the mobility behavior of ambients. C © 2002 Elsevier Science (USA)

[1]  Mogens Nielsen,et al.  Mathematical Foundations of Computer Science 2000 , 2001, Lecture Notes in Computer Science.

[2]  Michele Bugliesi,et al.  Secure safe ambients , 2001, POPL '01.

[3]  Martín Abadi,et al.  A Theory of Objects , 1996, Monographs in Computer Science.

[4]  Frank Yellin,et al.  The Java Virtual Machine Specification , 1996 .

[5]  Roberto M. Amadio,et al.  An Asynchronous Model of Locality, Failure and Process Mobility , 1997, COORDINATION.

[6]  Pascal Zimmer.  Subtyping and Typing Algorithms for Mobile Ambients , 2000, FoSSaCS.

[7]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[8]  Sergio Maffeis,et al.  An Abstract Interpretation Framework for Analysing Mobile Ambients , 2001, SAS.

[9]  Jérôme Feret,et al.  Abstract Interpretation-Based Static Analysis of Mobile Ambients , 2001, SAS.

[10]  Flemming Nielson,et al.  A Kleene Analysis of Mobile Ambients , 2000, ESOP.

[11]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[12]  Flemming Nielson,et al.  Validating Firewalls in Mobile Ambients , 1999, CONCUR.

[13]  Luca Cardelli,et al.  Mobility Types for Mobile Ambients , 1999, ICALP.

[14]  Luca Cardelli,et al.  Types for mobile ambients , 1999, POPL '99.

[15]  Matthew Hennessy.  A Typed Language for Distributed Mobile Processes , 1998 .

[16]  G. Erard Boudol.  Asynchrony and the -calculus (note) , 1992 .

[17]  Mads Tofte,et al.  Region-based Memory Management , 1997, Inf. Comput..

[18]  Munindar P. Singh,et al.  Agents on the Web: Mobile Agents , 1997, IEEE Internet Comput..

[19]  Davide Sangiorgi,et al.  Controlling interference in ambients , 2000, POPL '00.

[20]  Flemming Nielson,et al.  Control Flow Analysis for the pi-calculus , 1998, CONCUR.

[21]  Mariangiola Dezani-Ciancaglini,et al.  Security Types for Mobile Safe Ambients , 2000, ASIAN.

[22]  Luca Cardelli,et al.  Ambient Groups and Mobility Types , 2000, IFIP TCS.

[23]  Flemming Nielson,et al.  Shape analysis for mobile ambients , 2000, POPL '00.

[24]  R. Amadio,et al.  Localities and Failures , 1995 .

[25]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[26]  Pierpaolo Degano,et al.  Safe Ambients: Control Flow Analysis and Security , 2000, ASIAN.

[27]  Martín Abadi,et al.  Secrecy by typing in security protocols , 1999, JACM.

[28]  Thierry Coquand,et al.  The Calculus of Constructions , 1988, Inf. Comput..

[29]  Flemming Nielson,et al.  Abstract Interpretation of Mobile Ambients , 1999, SAS.

[30]  Peter Sewell.  Global/Local Subtyping and Capability Inference for a Distributed pi-calculus , 1998, ICALP.

[31]  Danny B. Lange,et al.  Programming and Deploying Java¿ Mobile Agents with Aglets¿ , 1998 .

[32]  Flemming Nielson,et al.  Abstract interpretation of mobile ambients , 2003, Sci. Comput. Program..

[33]  Luca Cardelli,et al.  Secrecy and Group Creation , 2000, CONCUR.

[34]  Chiara Bodei,et al.  Security Analysis for Mobile Ambients , 2000 .