[CCD+05] A Mobility Calculus with Local and Dependent Types

Abstract

We introduce an ambient calculus that combines ambient mobility with process mobility, uses group names to group ambients with homologous features, and exploits co-moves and runtime type checking to implement flexible policies for controlling process activities. Types rely on group names and, to support dynamicity, may depend on group variables. Policies can dynamically change also through installation of co-moves. The compliance with ambient policies can be checked locally to the ambients and requires no global assumptions. We prove that the type assignment system and the operational semantics of the calculus are `sound', and we define a sound and complete type inference algorithm which, when applied to terms whose type decorations only express the desired policies, computes the minimal type annotations required for their execution. As an application of our calculus, we present a couple of examples and linger on the setting up of policies for controlling the activities of the objects involved.

@inproceedings{CCDGP05:CCDGP05, volume = {3838}, pdf = {http://www.di.unito.it/~dezani/papers/CCDGP05.pdf}, issn = {0302-9743}, author = {Mario Coppo and Federico Cozzi and Mariangiola Dezani-Ciancaglini and Elio Giovannetti and Rosario Pugliese}, series = {LNCS}, booktitle = {Processes, Terms and Cycles: Steps on the Road to Infinity}, editor = {Middeldorp, Aart and van Oostrom, Vincent and van Raamsdonk, Femke and de Vrijer, Roel}, abstract = {We introduce an ambient calculus that combines ambient mobility with process mobility, uses group names to group ambients with homologous features, and exploits co-moves and runtime type checking to implement flexible policies for controlling process activities. Types rely on group names and, to support dynamicity, may \emph{depend} on group variables. Policies can dynamically change also through installation of co-moves. The compliance with ambient policies can be checked \emph{locally} to the ambients and requires no global assumptions. We prove that the type assignment system and the operational semantics of the calculus are `sound', and we define a sound and complete type inference algorithm which, when applied to terms whose type decorations only express the desired policies, computes the minimal type annotations required for their execution. As an application of our calculus, we present a couple of examples and linger on the setting up of policies for controlling the activities of the objects involved.}, title = {A Mobility Calculus with Local and Dependent Types}, isbn = {3-540-30911-X}, publisher = {Springer-Verlag}, pages = {404--444}, year = {2005}, }

CCDGP05:CCDGP05 (In proceedings)
Author(s)	Mario Coppo, Federico Cozzi, Mariangiola Dezani-Ciancaglini, Elio Giovannetti and Rosario Pugliese
Title	« A Mobility Calculus with Local and Dependent Types »
In	Processes, Terms and Cycles: Steps on the Road to Infinity
Series	LNCS
Editor(s)	Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk and Roel de Vrijer
Volume	3838
Page(s)	404--444
Year	2005
Publisher	Springer-Verlag
ISBN number	3-540-30911-X
ISSN number	0302-9743
PDF	http://www.di.unito.it/˜dezani/papers/CCDGP05.pdf