Replication package for Article: "SteelCore: An Extensible Concurrent Separation Logic for Effectful Dependently Typed Programs"

2020 ◽  
Author(s):  
Nikhil Swamy ◽  
Aseem Rastogi ◽  
Aymeric Fromherz ◽  
Denis Merigoux ◽  
Danel Ahman ◽  
...  
Keyword(s):  
Separation Logic ◽  
Concurrent Separation Logic

scholarly journals Cosmo: a concurrent separation logic for multicore OCaml

2020 ◽  
Vol 4 (ICFP) ◽  
pp. 1-29
Author(s):  
Glen Mével ◽  
Jacques-Henri Jourdan ◽  
François Pottier
Keyword(s):  
Separation Logic ◽  
Concurrent Separation Logic

scholarly journals TaDA Live: Compositional Reasoning for Termination of Fine-grained Concurrent Programs

2021 ◽  
Vol 43 (4) ◽  
pp. 1-134
Author(s):  
Emanuele D’Osualdo ◽  
Julian Sutherland ◽  
Azadeh Farzan ◽  
Philippa Gardner
Keyword(s):  
Case Studies ◽  
Separation Logic ◽  
Proof System ◽  
Concurrent Programs ◽  
Semantic Model ◽  
Compositional Reasoning ◽  
Fine Grained ◽  
Fundamental Innovation ◽  
Concurrent Separation Logic

We present TaDA Live, a concurrent separation logic for reasoning compositionally about the termination of blocking fine-grained concurrent programs. The crucial challenge is how to deal with abstract atomic blocking : that is, abstract atomic operations that have blocking behaviour arising from busy-waiting patterns as found in, for example, fine-grained spin locks. Our fundamental innovation is with the design of abstract specifications that capture this blocking behaviour as liveness assumptions on the environment. We design a logic that can reason about the termination of clients that use such operations without breaking their abstraction boundaries, and the correctness of the implementations of the operations with respect to their abstract specifications. We introduce a novel semantic model using layered subjective obligations to express liveness invariants and a proof system that is sound with respect to the model. The subtlety of our specifications and reasoning is illustrated using several case studies.

scholarly journals Skipping the binder bureaucracy with mixed embeddings in a semantics course (functional pearl)

2021 ◽  
Vol 5 (ICFP) ◽  
pp. 1-28
Author(s):  
Adam Chlipala
Keyword(s):  
Order Reduction ◽  
Separation Logic ◽  
Variable Binding ◽  
Type Checking ◽  
Session Types ◽  
The Coq Proof Assistant ◽  
Reduction Program ◽  
Coq Proof Assistant ◽  
Big Ideas ◽  
Concurrent Separation Logic

Rigorous reasoning about programs calls for some amount of bureaucracy in managing details like variable binding, but, in guiding students through big ideas in semantics, we might hope to minimize the overhead. We describe our experiment introducing a range of such ideas, using the Coq proof assistant, without any explicit representation of variables, instead using a higher-order syntax encoding that we dub "mixed embedding": it is neither the fully explicit syntax of deep embeddings nor the syntax-free programming of shallow embeddings. Marquee examples include different takes on concurrency reasoning, including in the traditions of model checking (partial-order reduction), program logics (concurrent separation logic), and type checking (session types) -- all presented without any side conditions on variables.

Concurrent separation logic

2016 ◽  
Vol 3 (3) ◽  
pp. 47-65 ◽  
Author(s):  
Stephen Brookes ◽  
Peter W. O'Hearn
Keyword(s):  
Separation Logic ◽  
Concurrent Separation Logic

scholarly journals Revisiting concurrent separation logic

2017 ◽  
Vol 89 ◽  
pp. 41-66
Author(s):  
Pedro Soares ◽  
António Ravara ◽  
Simão Melo de Sousa
Keyword(s):  
Separation Logic ◽  
Concurrent Separation Logic

scholarly journals Proof of Soundness of Concurrent Separation Logic for GPGPU in Coq

2016 ◽  
Vol 24 (1) ◽  
pp. 132-140 ◽  
Author(s):  
Izumi Asakura ◽  
Hidehiko Masuhara ◽  
Tomoyuki Aotani
Keyword(s):  
Separation Logic ◽  
Concurrent Separation Logic
Sign in / Sign up

Export Citation Format

Share Document