DeepAI AI Chat
Log In Sign Up

Concurrent Separation Logic Meets Template Games

by   Paul-André Melliès, et al.

An old dream of concurrency theory and programming language semantics has been to uncover the fundamental synchronization mechanisms which regulate situations as different as game semantics for higher-order programs, and Hoare logic for concurrent programs with shared memory and locks. In this paper, we establish a deep and unexpected connection between two recent lines of work on concurrent separation logic (CSL) and on template game semantics for differential linear logic (DiLL). Thanks to this connection, we reformulate in the purely conceptual style of template games for DiLL the asynchronous and interactive interpretation of CSL designed by Melliès and Stefanesco. We believe that the analysis reveals something important about the secret anatomy of CSL, and more specifically about the subtle interplay, of a categorical nature, between sequential composition, parallel product, errors and locks.


page 3

page 6

page 12

page 15

page 20

page 22

page 23

page 25


An Asynchronous soundness theorem for concurrent separation logic

Concurrent separation logic (CSL) is a specification logic for concurren...

Asynchronous Template Games and the Gray Tensor Product of 2-Categories

In his recent and exploratory work on template games and linear logic, M...

Revisiting concurrent separation logic

We present a new soundness proof of Concurrent Separation Logic (CSL) ba...

A Game Semantics of Concurrent Separation Logic

In this paper, we develop a game-theoretic account of concurrent separat...

From Thin Concurrent Games to Generalized Species of Structures

Two families of denotational models have emerged from the semantic analy...

The Cartesian Closed Bicategory of Thin Spans of Groupoids

Recently, there has been growing interest in bicategorical models of pro...

On the Unity of Logic: a Sequential, Unpolarized Approach

The present work aims to give a unity of logic via standard sequential, ...