An Asynchronous Soundness Theorem for Concurrent Separation Logic - Université Paris Cité Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

An Asynchronous Soundness Theorem for Concurrent Separation Logic

Résumé

Concurrent separation logic (CSL) is a specification logic for concurrent imperative programs with shared memory and locks. In this paper, we develop a concurrent and interactive account of the logic inspired by asynchronous game semantics. To every program C, we associate a pair of asynchronous transition systems C_S and C_L which describe the operational behavior of the Code when confronted to its Environment or Frame - both at the level of machine states (S) and of machine instructions and locks (L). We then establish that every derivation tree π of a judgment Γ {P }C{Q} defines a winning and asynchronous strategy π_Sep with respect to both asynchronous semantics C_S and C_L. From this, we deduce an asynchronous soundness theorem for CSL, which states that the canonical map L : C_S → C_L from the stateful semantics C_S to the stateless semantics C_L satisfies a basic fibrational property. We advocate that this property provides a clean and conceptual explanation for the usual soundness theorem of CSL, including the absence of data races.
Fichier principal
Vignette du fichier
lics2018-concurrent-separation-logic.pdf (712.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02436304 , version 1 (12-01-2020)

Identifiants

  • HAL Id : hal-02436304 , version 1

Citer

Paul-André Melliès, Léo Stefanesco. An Asynchronous Soundness Theorem for Concurrent Separation Logic. Thirty-Third Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018), Jul 2018, Oxford, United Kingdom. ⟨hal-02436304⟩
40 Consultations
27 Téléchargements

Partager

Gmail Facebook X LinkedIn More