Results 1 
5 of
5
A Uniform Type Structure for Secure Information Flow
, 2002
"... The \picalculus is a formalism of computing in which we can compositionally represent dynamics of major programming constructs by decomposing them into a single communication primitive, the name passing. This work reports our experience in using a linear/affine typed \picalculus for the analysis a ..."
Abstract

Cited by 76 (11 self)
 Add to MetaCart
The \picalculus is a formalism of computing in which we can compositionally represent dynamics of major programming constructs by decomposing them into a single communication primitive, the name passing. This work reports our experience in using a linear/affine typed \picalculus for the analysis and development of type systems of programming languages, focussing on secure information flow analysis. After presenting a basic typed calculus for secrecy, we demonstrate its usage by a sound embedding of the dependency core calculus (DCC) and by the development of a novel type discipline for imperative programs which extends both a secure multithreaded imperative language by Smith and Volpano and (a callbyvalue version of) DCC. In each case, the embedding gives a simple proof of noninterference.
Secure Information Flow as Typed Process Behaviour
, 2000
"... We propose a new type discipline for the calculus in which secure information ow is guaranteed by static type checking. Secrecy levels are assigned to channels and are controlled by subtyping. A behavioural notion of types capturing causality of actions plays an essential role for ensuring safe ..."
Abstract

Cited by 52 (0 self)
 Add to MetaCart
We propose a new type discipline for the calculus in which secure information ow is guaranteed by static type checking. Secrecy levels are assigned to channels and are controlled by subtyping. A behavioural notion of types capturing causality of actions plays an essential role for ensuring safe information ow in diverse interactive behaviours, making the calculus powerful enough to embed known calculi for typebased security. The paper introduces the core part of the calculus, presents its basic syntactic properties, and illustrates its use as a tool for programming language analysis by a sound embedding of a secure multithreaded imperative calculus of Volpano and Smith. The embedding leads to a practically meaningful extension of their original type discipline.
Linearity and bisimulation
 In FoSSaCs'02 (2002
, 2002
"... Abstract. Exploiting linear type structure, we introduce a new theory of weak bisimilarity for the πcalculus in which we abstract away not only τactions but also nonτ actions which do not affect welltyped observers. This gives a congruence far larger than the standard bisimilarity while retainin ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
Abstract. Exploiting linear type structure, we introduce a new theory of weak bisimilarity for the πcalculus in which we abstract away not only τactions but also nonτ actions which do not affect welltyped observers. This gives a congruence far larger than the standard bisimilarity while retaining semantic soundness. The framework is smoothly extendible to other settings involving nondeterminism and state. As an application we develop a behavioural theory of secrecy in the πcalculus which ensures secure information flow for a strictly greater set of processes than the typebased approach in [20, 23], while still offering compositional verification techniques. 1
TypeBased Liveness Guarantee in the Presence of Nontermination and Nondeterminism
, 2002
"... This paper investigates a typebased framework to guarantee a basic liveness property in the calculus. The resulting liveness property ensures that the action at a speci ed channel will eventually re, in spite of the presence of nondeterminism and possibly diverging computation. We rst integr ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
This paper investigates a typebased framework to guarantee a basic liveness property in the calculus. The resulting liveness property ensures that the action at a speci ed channel will eventually re, in spite of the presence of nondeterminism and possibly diverging computation. We rst integrate nontermination into the linear calculus introduced in [35], for which we prove the liveness by a translation into the linear calculus, preserving a speci c sequence of typed actions.
On Behavioural Interpretation of Types in Name Passing Calculi (extended )
"... We introduce a theory of behavioural types as a semantic foundation of typed ßcalculi. In this theory, a type is a set of behaviours, represented by early name passing synchronisation trees, which conform to a certain behavioural constraint. Operations on typed processes are derived from typed vari ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We introduce a theory of behavioural types as a semantic foundation of typed ßcalculi. In this theory, a type is a set of behaviours, represented by early name passing synchronisation trees, which conform to a certain behavioural constraint. Operations on typed processes are derived from typed variants of wellknown processtheoretic operations for mobile processes, and each model of typed ßcalculi in a typed universe induces a compositional theory of typed bisimilarities. The construction is simple and intuitive, yet offers a rich class of typed universes of name passing interactive behaviours, which contain, among others, models of known typed ßcalculi and universes of game semantics. As a simple but nontrivial application, we show how the sorting by Milner can be given a sound model in a basic universe of types. The soundness states not only that the interpretation is sound in the standard sense, but also that the untyped interactive behaviour of typed terms is justifiable on t...