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

25Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Raad, A., Doko, M., Rožić, L., Lahav, O., & Vafeiadis, V. (2019). On library correctness under weak memory consistency specifying and verifying concurrent libraries under declarative consistency models. Proceedings of the ACM on Programming Languages, 3(POPL). https://doi.org/10.1145/3290381

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free