We describe a type system for checking interference using the concept of linear capabilities
(which we call “permissions”). Our innovations include the concept of “fractional” …

We propose a type system to ensure the property of noninterference in a system of
concurrent programs, described in a standard imperative language enriched with …

We present a trace semantics for a language of parallel programs which share access to
mutable data. We introduce a resource-sensitive logic for partial correctness, based on a …

An increasing number of systems rely on programming language technology to ensure
safety and security of low-level code. Unfortunately, these systems typically rely on a …

In programming languages which permit both assignment and procedures, distinct
identifiers can represent data structures which share storage or procedures with interfering …

A lightweight logical approach to race-free sharing of heap storage between concurrent
threads is described, based on the notion of permission to access. Transfer of permission …

We propose an extension of the asynchronous π-calculus in which a variety of security
properties may be captured using types. These are an extension of the Input/Output types for …

This paper shows how to systematically extend an arbitrary type system with dependency
information, and how soundness and non-interference proofs for the new system may rely …

We propose a new kind of programming language, with the following features: a simple
graph rewriting semantics, a complete symmetry between constructors and destructors, a …

A key challenge for concurrent programming is that side-effects (memory operations) in one
thread can affect the behavior of another thread. In this paper, we present a type system to …