There is a newer version of the record available.

Published October 6, 2020 | Version v1
Software Open

On Algebraic Abstractions for Concurrent Separation Logics (artefact)

  • 1. IMDEA Software Institute
  • 2. Nomadic Labs

Description

This artefact is a companion to the paper:

František Farka, Aleksandar Nanevski, Anindya Banerjee, Germán Andrés Delbianco, and Ignacio Fábregas.
2021. On Algebraic Abstractions for Concurrent Separation Logics. Proc. ACM Program. Lang. 5, POPL, Arti-
cle 5 (January 2021), 32 pages. https://doi.org/10.1145/3434286

The artefact contains Coq sources of the developments presented in the paper. The artefact supports the
developments in both a theoretical and practical way. First, it provides a complete bottom-up mechanization of partial commutative monoids (PCM), separating relations, PCM morphisms, and the related constructions. The artefact formalizes all the concepts defined in the paper, Secondly, the artifact demonstrate practical utilisation of the theory of PCMs.
Using FCSL (Nanevski et al, 2019) as the opaque type theory, the artefact provides mechanical verification of Ticket lock, the running example developed in the paper. The artefact also contains additional examples that the main body submission does not discuss.

Files

README.pdf

Files (1.5 GB)

Name Size Download all
md5:1ee5d1d7919a04dc32de0ae0a976e61c
1.5 GB Download
md5:d6559e1a425e42396a2d6d192f16b64b
217.3 kB Preview Download

Additional details

Related works

Is supplement to
Journal article: 10.1145/3434286 (DOI)
Preprint: arXiv:2010.12686 (arXiv)

Funding

European Commission
Mathador - Type and Proof Structures for Concurrent Software Verification 724464