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 language | English |
|---|---|
| Article number | 68 |
| Journal | Proceedings of the ACM on Programming Languages |
| Volume | 3 |
| Issue number | POPL |
| DOIs | |
| State | Published - Jan 2019 |
Keywords
- Concurrent libraries
- Linearisability
- Weak memory consistency
All Science Journal Classification (ASJC) codes
- Software
- Safety, Risk, Reliability and Quality
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver