Results 1 
5 of
5
Security Types for Dynamic Web Data
, 2008
"... We describe a type system for the Xdπ calculus of Gardner and Maffeis. An Xdπnetwork is a network of locations, where each location consists of both a data tree (which contains scripts and pointers to nodes in trees at different locations) and a process, for modelling process interaction, process m ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
We describe a type system for the Xdπ calculus of Gardner and Maffeis. An Xdπnetwork is a network of locations, where each location consists of both a data tree (which contains scripts and pointers to nodes in trees at different locations) and a process, for modelling process interaction, process migration and interaction between processes and data. Our type system is based on types for locations, data and processes, expressing security levels. A tree can store data of different security level, independently from the security level of the enclosing location. The access and mobility rights of a process depend on the security level of the “source ” location of the process itself, i.e. of the location where the process was in the initial network or where the process was created by the activation of a script. The type system enjoys type preservation under reduction (subject reduction). In consequence of subject reduction we prove the following security properties. In a welltyped Xdπnetwork, a process P whose source location is of level h can copy data of security level at most h and update data of security level less than h. Moreover, the process P can only communicate data and go to locations of security level equal or less than h.
Under consideration for publication in Math. Struct. in Comp. Science Boxed Ambients with Communication Interfaces †
, 2006
"... an ambient calculus with a flexible communication policy. Traditionally, typed ambient calculi have a fixed communication policy determining the kind of information that can be exchanged with a parent ambient, even though mobility changes the parent. BACI lifts that restriction, allowing different c ..."
Abstract
 Add to MetaCart
(Show Context)
an ambient calculus with a flexible communication policy. Traditionally, typed ambient calculi have a fixed communication policy determining the kind of information that can be exchanged with a parent ambient, even though mobility changes the parent. BACI lifts that restriction, allowing different communication policies with different parents during computation. Furthermore, BACI splits communication and mobility by making explicit the channels of communication between ambients. In contrast with other typed ambient calculi where communication policies are global, each ambient in BACI is equipped with a description of the communication policies ruling its information exchange with parent and child ambients. The communication policies of ambients increase when they move: more precisely, when an ambient enters another ambient, the entering ambient and the host ambient can exchange their communication ports and agree on the kind of information to be exchanged. This information is recorded locally in both ambients. We show the typesoundness of BACI, proving that it satisfies the subject reduction property, and we study its behavioural semantics by means of a labelled transition system.
Under consideration for publication in Math. Struct. in Comp. Science Isomorphism of Intersection and Union Types †
, 2012
"... This paper gives a complete characterisation of type isomorphism definable by terms of a λcalculus in a type system with intersection and union types. Type isomorphism is usually proved using a form of Inversion Lemma to relate terms and types. Currently in the literature no inversion lemma for int ..."
Abstract
 Add to MetaCart
(Show Context)
This paper gives a complete characterisation of type isomorphism definable by terms of a λcalculus in a type system with intersection and union types. Type isomorphism is usually proved using a form of Inversion Lemma to relate terms and types. Currently in the literature no inversion lemma for intersection and union types is provided. Moreover, the subject reduction property does not hold in general when union is considered. However it is well known that in λcalculus, independently of the considered type system, the isomorphism between two types can be realised only by an invertible term. Notably all invertible terms are linear terms. In this paper the isomorphism of intersection and union types is investigated using a relevant type system for linear terms enjoying subject reduction property and a suitable form of inversion lemma. To characterise type isomorphism a notion of similarity between types and a notion of type reduction are introduced. Types are proved to have a unique normal form with respect to the reduction rules and two types are proved to be isomorphic if and only if their normal forms are similar. Contents
Security Types for Dynamic Web Data 1 Mariangiola DezaniCiancaglini a Silvia Ghilezan b
"... We describe a type system for the Xdπ calculus of Gardner and Maffeis. An Xdπnetwork is a network of locations, where each location consists of both a data tree (which contains scripts and pointers to nodes in trees at different locations) and a process, for modelling process interaction, process m ..."
Abstract
 Add to MetaCart
(Show Context)
We describe a type system for the Xdπ calculus of Gardner and Maffeis. An Xdπnetwork is a network of locations, where each location consists of both a data tree (which contains scripts and pointers to nodes in trees at different locations) and a process, for modelling process interaction, process migration and interaction between processes and data. Our type system is based on types for locations, data and processes, expressing security levels. A tree can store data of different security level, independently from the security level of the enclosing location. The access and mobility rights of a process depend on the security level of the “source ” location of the process itself, i.e. of the location where the process was in the initial network or where the process was created by the activation of a script. The type system enjoys type preservation under reduction (subject reduction). In consequence of subject reduction we prove the following security properties. In a welltyped Xdπnetwork, a process P whose source location is of level h can copy data of security level at most h and update data of security level less than h. Moreover, the process P can only communicate data and go to locations of security level equal or less than h. 1