Refinement types enrich a language's type system with logical predicates that circumscribe
the set of values described by the type. These refinement predicates provide software …

The Rust programming language provides a powerful type system that checks linearity and
borrowing, allowing code to safely manipulate memory without garbage collection and …

Resources, Concurrency and Local Reasoning Page 1 To appear in Theoretical Computer
Science Resources, Concurrency and Local Reasoning ∗ Peter W. O’Hearn Queen Mary …

Reynolds has developed a logic for reasoning about mutable data structures in which the
pre-and postconditions are written in an intuitionistic logic enriched with a spatial form of …

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” …

Given the central role that C continues to play in systems software, and the difficulty of
writing safe and correct C code, it remains a grand challenge to develop effective formal …

Noninterference is a property of sequential programs that is useful for expressing security
policies for data confidentiality and integrity. However, extending noninterference to …

A thorough and accessible introduction to a range of key ideas in type systems for
programming language. The study of type systems for programming languages now touches …

We present a system for extending standard type systems with flow-sensitive type qualifiers.
Users annotate their programs with type qualifiers, and inference checks that the …

The reliability of infrastructure software, such as operating systems and web servers, is often
hampered by the mismanagement of resources, such as memory and network connections …