Results 1 
6 of
6
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 91 (12 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 33 (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.
Sequentiality and the πCalculus
, 2001
"... We present a simple type discipline for the πcalculus which precisely captures the notion of sequential functional computation as a specific class of name passing interactive behaviour. The typed calculus allows direct interpretation of both callbyname and callbyvalue sequential functions. T ..."
Abstract

Cited by 30 (16 self)
 Add to MetaCart
We present a simple type discipline for the πcalculus which precisely captures the notion of sequential functional computation as a specific class of name passing interactive behaviour. The typed calculus allows direct interpretation of both callbyname and callbyvalue sequential functions. The precision of the representation is demonstrated by way of a fully abstract encoding of PCF.
Process Logic and Duality  Part I: Sequential Processes
"... We present typed process logics for the πcalculus with linear/affine type disciplines. Built on the preceding studies on logics for programs and processes, simple systems of assertions are developed, capturing the classes of behaviours ranging from purely functional interactions to those with de ..."
Abstract
 Add to MetaCart
We present typed process logics for the πcalculus with linear/affine type disciplines. Built on the preceding studies on logics for programs and processes, simple systems of assertions are developed, capturing the classes of behaviours ranging from purely functional interactions to those with destructive update, local state and genericity. A central feature of the logic is representation of the environments' behaviour as the dual of those of processes in assertions, which is crucial for obtaining compositional proof systems. This paper develops typed process logics starting from purely functional behaviours and treating increasingly complex ones, and illustrate their usage by deriving program logics for higherorder languages. The embedding of the proof rules in the derived logics into the process logics gives a simple proof of the soundness of the former. Some of the derived logics correspond to known program logics, including Hoare logic for imperative programs.
Abstract From Process Logic to Program Logic
"... We present a process logic for the πcalculus with the linear/affine ..."
(Show Context)
Under consideration for publication in J. Functional Programming 1 From Process Logic to Program Logic Kohei Honda
"... We present a process logic for the πcalculus with the linear/affine type discipline (Berger et al. ..."
Abstract
 Add to MetaCart
We present a process logic for the πcalculus with the linear/affine type discipline (Berger et al.