TY - JOUR
T1 - On library correctness under weak memory consistency specifying and verifying concurrent libraries under declarative consistency models
AU - Raad, Azalea
AU - Doko, Marko
AU - Rožić, Lovro
AU - Lahav, Ori
AU - Vafeiadis, Viktor
N1 - Publisher Copyright: © 2019 Copyright held by the owner/author(s).
PY - 2019/1
Y1 - 2019/1
N2 - 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.
AB - 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.
KW - Concurrent libraries
KW - Linearisability
KW - Weak memory consistency
UR - http://www.scopus.com/inward/record.url?scp=85120109852&partnerID=8YFLogxK
U2 - https://doi.org/10.1145/3290381
DO - https://doi.org/10.1145/3290381
M3 - مقالة
SN - 2475-1421
VL - 3
JO - Proceedings of the ACM on Programming Languages
JF - Proceedings of the ACM on Programming Languages
IS - POPL
M1 - 68
ER -