Published July 3, 2021 | Version git:ff0a124
Software Open

Formal Verification of a Concurrent Bounded Queue in a Weak Memory Model — proof artifact

  • 1. Inria, Université Paris-Saclay, CNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles, France
  • 2. Université Paris-Saclay, CNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles, France

Description

This is the artifact that accompanies the paper “Formal Verification of a Concurrent Bounded Queue in a Weak Memory Model“, published at the ICFP 2021 conference.

The artifact consists in a set of Coq proof scripts. A plain source code archive is provided, as well as a virtual machine in which all dependencies are already installed and the project already compiled.

This project is developped in this git repository, which also contains the paper.

Files

icfp21-paper23.pdf

Files (2.1 GB)

Name Size Download all
md5:09109ee3a180ddc52424762a70a5ac6b
2.1 GB Download
md5:a8d215e7c501cf13a439ecb70122d7e3
81.5 kB Download
md5:e5bb0a5fa8db79e15b736bea3c92bd1a
668.4 kB Preview Download

Additional details

Related works

Is supplement to
Conference paper: 10.1145/3473571 (DOI)