Concurrent Separation Logic Meets Template Games
Preprint
Abstract
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\`es 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.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Iris from the ground up: A modular foundation for higher-order concurrent separation logicJournal of Functional Programming, 2018
- A Game Semantics of Concurrent Separation LogicElectronic Notes in Theoretical Computer Science, 2018
- Directed Algebraic Topology and Concurrency2016
- Communicating State Transition Systems for Fine-Grained Concurrent Resources2014
- Concurrent Separation Logic and Operational SemanticsElectronic Notes in Theoretical Computer Science, 2011
- Polycategories via pseudo-distributive lawsAdvances in Mathematics, 2008
- A semantics for concurrent separation logicTheoretical Computer Science, 2007
- On the expressiveness of higher dimensional automataTheoretical Computer Science, 2006
- Lifting results for categories of algebrasTheoretical Computer Science, 2002
- Monoidal Bicategories and Hopf AlgebroidsAdvances in Mathematics, 1997