Data races have long been a notorious problem in concurrent programming. They are hard
to detect, and lead to non-deterministic behaviours. There has been a lot of interest in type …

Abstract Effect systems are lightweight extensions to type systems that can verify a wide
range of important properties with modest developer burden. But our general understanding …

We adapt a variant of permission-accounting separation logic to a concurrent Java-like
language with fork/join. To support both concurrent reads and information hiding, we …

By combining existing type systems with standard type-based compilation techniques, we
describe how to write strongly typed programs that include a function that acts as at racing …

40 simplest end of the range, a specifier can mark those methods that allocate and release
resource (s). A specifier can also limit the order in which an objects methods may be called …

A linear parameter must be consumed exactly once in the body of its function. When
declaring resources such as file handles and manually managed memory as linear …

This paper presents a formal definition and machine-checked soundness proof for a very
expressive type-and-capability system, that is, a low-level type system that keeps precise …

A certified binary is a value together with a proof that the value satisfies a given specification.
Existing compilers that generate certified code have focused on simple memory and control …

This article presents a static system for checking determinism (technically, partial
confluence) of communicating concurrent processes. Our approach automatically detects …

We consider the verification of lock-free data structures that manually manage their memory
with the help of a safe memory reclamation (SMR) algorithm. Our first contribution is a type …