On library correctness under weak memory consistency specifying and verifying concurrent libraries under declarative consistency models

Azalea Raad, Marko Doko, Lovro Rožić, Ori Lahav, Viktor Vafeiadis

Research output: Contribution to journalArticlepeer-review

Abstract

Concurrent libraries are the building blocks for concurrency. They encompass a range of abstractions (e.g. locks, exchangers, stacks, queues, sets) built in a layered fashion: more advanced libraries are built out of simpler ones. While there has been a lot of work on verifying such libraries in a sequentially consistent (SC) environment, little is known about how to specify and verify them under weak memory consistency (WMC). We propose a general declarative framework that allows us to specify concurrent libraries declaratively, and to verify library implementations against their specifications compositionally. Our framework is sufficient to encode standard models such as SC, (R)C11 and TSO. Additionally, we specify several concurrent libraries, including mutual exclusion locks, reader-writer locks, exchangers, queues, stacks and sets. We then use our framework to verify multiple weakly consistent implementations of locks, exchangers, queues and stacks.

Original languageEnglish
Article number68
JournalProceedings of the ACM on Programming Languages
Volume3
Issue numberPOPL
DOIs
StatePublished - Jan 2019

Keywords

  • Concurrent libraries
  • Linearisability
  • Weak memory consistency

Fingerprint

Dive into the research topics of 'On library correctness under weak memory consistency specifying and verifying concurrent libraries under declarative consistency models'. Together they form a unique fingerprint.

Cite this