Session types employ a linear type system that ensures that communication channels
cannot be implicitly copied or discarded. As a result, many mechanizations of these systems …

We introduce CLASS, a session-typed, higher-order, core language that supports concurrent
computation with shared linear state. We believe that CLASS is the first proposal for a …

Reasoning about concurrent programs is challenging, especially if data is shared among
threads. Program correctness can be violated by the presence of data races—whose …

We introduce a linear concurrent separation logic, called LinearActris, designed to
guarantee deadlock and leak freedom for message-passing concurrency. LinearActris …

RefFS is the first concurrent file system that guarantees both liveness and safety, backed by
a machine-checkable proof. Unlike earlier concurrent file systems, RefFS provably avoids …

This paper introduces Hypersequent GV (HGV), a modular and extensible core calculus for
functional programming with session types that enjoys deadlock freedom, confluence, and …

Disentanglement is a run-time property of parallel programs that facilitates task-local
reasoning about the memory footprint of parallel tasks. In particular, it ensures that a task …

We develop an account of dependent session protocols in concurrent separation logic for a
functional language with message-passing. Inspired by minimalistic session calculi, we …

We introduce λ (“lambda-barrier”), a minimal extension of linear λ-calculus with concurrent
communication, which adds only a single new fork construct for spawning threads. It is …

Multiparty Session Types (MPST) are a typing disciplines that guarantee the absence of
deadlocks and communication errors in concurrent and distributed systems. However …