Results 1 
4 of
4
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 80 (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.
Strong Normalisation in the πCalculus
, 2001
"... We introduce a typed πcalculus where strong normalisation is ensured by typability. Strong normalisation is a useful property in many computational contexts, including distributed systems. In spite of its simplicity, our type discipline captures a wide class of converging namepassing interactive b ..."
Abstract

Cited by 32 (17 self)
 Add to MetaCart
We introduce a typed πcalculus where strong normalisation is ensured by typability. Strong normalisation is a useful property in many computational contexts, including distributed systems. In spite of its simplicity, our type discipline captures a wide class of converging namepassing interactive behaviour. The proof of strong normalisability combines methods from typed lcalculi and linear logic with processtheoretic reasoning. It is adaptable to systems involving state and other extensions. Strong normalisation is shown to have significant consequences, including finite axiomatisation of weak bisimilarity, a fully abstract embedding of the simplytyped lcalculus with products and sums and basic liveness in interaction.
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 19 (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
Processes, Types and Information Flow
"... . We develop a behavioural theory of secure information ow using a typed calculus as a metalanguage, and show its applicability to the analysis and reasoning of secrecy concerns in programming languages. The key technical novelty is a new typed bisimilarity which accurately captures the ow of infor ..."
Abstract
 Add to MetaCart
. We develop a behavioural theory of secure information ow using a typed calculus as a metalanguage, and show its applicability to the analysis and reasoning of secrecy concerns in programming languages. The key technical novelty is a new typed bisimilarity which accurately captures the ow of information among processes based on a given type structure. A behavioural theory of secrecy is introduced, for which we establish fundamental results such as noninterference. The use of the general theory is shown by formulating and establishing a compositional soundness property for a generalisation of the multithreaded imperative calculus by VolpanoSmith [32]; and by introducing sound typing rules for mutable and immutable references and local declaration based on the analysis using the typed process representation. The soundness of the new typing rules is again established using the general theory. 1 Introduction This paper presents a basic principle for analysing and reasoning about s...