A Calculus of Bounded Capacities

Resource control has attracted increasing interest in foundational research on distributed systems. This paper focuses on space control and develops an analysis of space usage in the context of an ambient-like calculus with bounded capacities and weighed processes, where migration and activation require space. A type system complements the dynamics of the calculus by providing static guarantees that the intended capacity bounds are preserved throughout the computation.

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

[2]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[3]  Robin Milner,et al.  The Problem of "Weak Bisimulation up to" , 1992, CONCUR.

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

[5]  Martin Hofmann,et al.  Static prediction of heap space usage for first-order functional programs , 2003, POPL '03.

[6]  Martin Hofmann,et al.  The strength of non-size increasing computation , 2002, POPL '02.

[7]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[8]  James Riely,et al.  Resource Access Control in Systems of Mobile Agents , 2002, HLCL.

[9]  Nobuko Yoshida,et al.  Suptyping and Locality in Distributed Higher Order Processes (extended abstract) , 1999, CONCUR.

[10]  David Teller,et al.  Using Ambients to Control Resources , 2002, CONCUR.

[11]  Davide Sangiorgi,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[12]  Julian Rathke,et al.  Towards a behavioural theory of access and mobility control in distributed systems , 2003, Theor. Comput. Sci..

[13]  Joe B. Wells,et al.  The Essence of Principal Typings , 2002, ICALP.

[14]  Rocco De Nicola,et al.  Types for access control , 2000, Theor. Comput. Sci..

[15]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[16]  James Riely,et al.  Information Flow vs. Resource Access in the Asynchronous Pi-Calculus , 2000, ICALP.

[17]  Michele Bugliesi,et al.  Communication and mobility control in boxed ambients , 2005, Inf. Comput..

[18]  Francesco Zappa Nardelli.  De la sémantique des processus d'ordre supérieur , 2003 .

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

[20]  Atsushi Igarashi,et al.  Resource usage analysis , 2002, POPL '02.

[21]  Davide Sangiorgi,et al.  Extensionality and intensionality of the ambient logics , 2001, POPL '01.

[22]  Luca Cardelli,et al.  Equational Properties Of Mobile Ambients , 2003, Math. Struct. Comput. Sci..

[23]  Karl Crary,et al.  Resource bound certification , 2000, POPL '00.

[24]  Vladimiro Sassone,et al.  A Type Inference Algorithm for Secure Ambients , 2001, Electron. Notes Theor. Comput. Sci..

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

[26]  Davide Sangiorgi,et al.  A Distributed Abstract Machine for Safe Ambients , 2001, ICALP.

[27]  James Riely,et al.  Resource Access Control in Systems of Mobile Agents , 2002, Inf. Comput..

[28]  Vladimiro Sassone,et al.  A Calculus of Mobile Resources , 2002, CONCUR.

[29]  Nobuko Yoshida,et al.  Subtyping and locality in distributed higher order processes , 1999 .

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

[31]  Witold Charatonik,et al.  Finite-Control Mobile Ambients , 2002, ESOP.

[32]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .