PLDI 2022 (series) / SIGPLAN Track /
(ICFP 2021) Formal Verification of a Concurrent Bounded Queue in a Weak Memory Model
We use Cosmo, a modern concurrent separation logic, to formally specify and verify an implementation of a multiple-writer multiple-reader 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.
Thu 16 JunDisplayed time zone: Pacific Time (US & Canada) change
Thu 16 Jun
Displayed time zone: Pacific Time (US & Canada) change
10:40 - 12:00 | |||
10:40 20mTalk | (ICFP 2021) Formal Verification of a Concurrent Bounded Queue in a Weak Memory Model SIGPLAN Track Glen Mével Inria, Université Paris-Saclay, CNRS, ENS Paris-Saclay, Laboratoire des méthodes formelles, Jacques-Henri Jourdan Université Paris-Saclay, CNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles | ||
11:00 20mTalk | (PLDI 2020) Zippy LL(1) Parsing with Derivatives SIGPLAN Track | ||
11:20 20mTalk | (PLDI 2021) CoStar: A Verified ALL(*) Parser SIGPLAN Track Sam Lasser Tufts University, Chris Casinghino Draper Laboratory, Kathleen Fisher Tufts University, Cody Roux Draper | ||
11:40 20mTalk | (PLDI 2021) Transfinite Iris: Resolving an Existential Dilemma of Step-Indexed Separation Logic SIGPLAN Track Simon Spies MPI-SWS & Saarland University, Lennard Gäher MPI-SWS & Saarland University, Daniel Gratzer Aarhus University, Joseph Tassarotti Boston College, Robbert Krebbers Radboud University Nijmegen, Derek Dreyer MPI-SWS, Lars Birkedal Aarhus University |