A Control Flow Analysis for Safe and Boxed Ambients

We present two main contributions: (i) an encoding of Boxed Ambients into a variant of Safe Ambients; (ii) a new Control Flow Analysis for Safe Ambients. Then, we show that the analysis, when applied to the encoded processes, permits to accurately verify Mandatory Access Control policies of the source processes.

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

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

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

[4]  Torben Amtoft,et al.  What Are Polymorphically-Typed Ambients? , 2001, ESOP.

[5]  Flemming Nielson,et al.  Validating firewalls using flow logics , 2002, Theor. Comput. Sci..

[6]  Michele Bugliesi,et al.  Communication Interference in Mobile Boxed Ambients , 2002, FSTTCS.

[7]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[8]  Michele Bugliesi,et al.  Reasoning about Security in Mobile Ambients , 2001, CONCUR.

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

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

[11]  Davide Sangiorgi,et al.  Mobile safe ambients , 2003, TOPL.

[12]  He Jifeng,et al.  Advances in Computing Science — ASIAN 2000 , 2002, Lecture Notes in Computer Science.

[13]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[14]  R. Milner,et al.  Bigraphical Reactive Systems , 2001, CONCUR.

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

[16]  Jinyuan You,et al.  Typing evolving ambients , 2001, Inf. Process. Lett..

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

[18]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[19]  Agostino Cortesi,et al.  Control Flow Analysis of Mobile Ambients with Security Boundaries , 2002, FMOODS.

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

[21]  Manindra Agrawal,et al.  FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science , 2002, Lecture Notes in Computer Science.

[22]  Francesca Levi.  Types for Evolving Communication in Safe Ambients , 2003, VMCAI.

[23]  Vladimiro Sassone,et al.  Typing and Subtyping Mobility in Boxed Ambients , 2002, CONCUR.

[24]  Benjamin C. Pierce,et al.  Theoretical Aspects of Computer Software , 2001, Lecture Notes in Computer Science.

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

[26]  Matthew Hennessy,et al.  Bisimulation congruences in safe ambients , 2002, POPL '02.

[27]  Luca Cardelli,et al.  Types for the ambient calculus , 2002 .

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

[29]  Michele Bugliesi,et al.  Boxed Ambients , 2001, TACS.

[30]  Michele Bugliesi,et al.  Information Flow Security for Boxed Ambients , 2002, F-WAN@ICALP.

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

[32]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.