Formal Verification of a Concurrent Bounded Queue in a Weak Memory Model - Laboratoire Méthodes Formelles Access content directly
Conference Papers Year : 2021

Formal Verification of a Concurrent Bounded Queue in a Weak Memory Model

Abstract

We use Cosmo, a modern concurrent separation logic, to formally specify and verify an implementation of a multiple-producer multiple-consumer concurrent queue in the setting of the Multicore OCaml weak memory model. We view this result as a demonstration and experimental verification of the manner in which Cosmo allows modular and formal reasoning about advanced concurrent data structures. In particular, we show how the joint use of logically atomic triples and of Cosmo's views makes it possible to describe precisely in the specification the interaction between the queue library and the weak memory model.
Fichier principal
Vignette du fichier
main.pdf (611.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03298759 , version 1 (24-07-2021)

Identifiers

Cite

Glen Mével, Jacques-Henri Jourdan. Formal Verification of a Concurrent Bounded Queue in a Weak Memory Model. ICFP 2021 - 26th ACM SIGPLAN International Conference on Functional Programming, Aug 2021, Virtual, Japan. ⟨10.1145/3473571⟩. ⟨hal-03298759⟩
136 View
71 Download

Altmetric

Share

Gmail Facebook X LinkedIn More