DeepAI AI Chat
Log In Sign Up

A Game Semantics of Concurrent Separation Logic

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

In this paper, we develop a game-theoretic account of concurrent separation logic. To every execution trace of the Code confronted to the Environment, we associate a specification game where Eve plays for the Code, and Adam for the Environment. The purpose of Eve and Adam is to decompose every intermediate machine state of the execution trace into three pieces: one piece for the Code, one piece for the Environment, and one piece for the available shared resources. We establish the soundness of concurrent separation logic by interpreting every derivation tree of the logic as a winning strategy of this specification game.


page 1

page 2

page 3

page 4


An Asynchronous soundness theorem for concurrent separation logic

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

Towards Concurrent Quantitative Separation Logic

In this paper, we develop a novel verification technique to reason about...

Compositional specification in rewriting logic

Rewriting logic is naturally concurrent: several subterms of the state t...

Leaf: Modularity for Temporary Sharing in Separation Logic (Extended Version)

In concurrent verification, separation logic provides a strong story for...

Concurrent Separation Logic Meets Template Games

An old dream of concurrency theory and programming language semantics ha...

Asynchronous games on Petri nets and ATL

We define a game on distributed Petri nets, where several players intera...

Formalizing and Verifying Decentralized Systems with Extended Concurrent Separation Logic

Decentralized techniques are becoming crucial and ubiquitous with the ra...