Doherty, S., Dongol, B., Wehrheim, H. et al. (1 more author) (2018) Making linearizability compositional for partially ordered executions. In: Furia, C. and Winter, K., (eds.) Integrated Formal Methods. IFM 2018, 05-07 Sep 2018, Maynooth, Ireland. Lecture Notes in Computer Science, 11023 . Springer Verlag , pp. 110-129. ISBN 9783319989372
Abstract
In the interleaving model of concurrency, where events are totally ordered, linearizability is compositional: the composition of two linearizable objects is guaranteed to be linearizable. However, linearizability is not compositional when events are only partially ordered, as in the weak-memory models that describe multicore memory systems. In this paper, we present a generalisation of linearizability for concurrent objects implemented in weak-memory models. We abstract from the details of specific memory models by defining our condition using Lamport’s execution structures. We apply our condition to the C11 memory model, providing a correctness condition for C11 objects. We develop a proof method for verifying objects implemented in C11 and related models. Our method is an adaptation of simulation-based methods, but in contrast to other such methods, it does not require that the implementation totally orders its events. We apply our proof technique and show correctness of the Treiber stack that blocks on empty, annotated with C11 release-acquire synchronisation.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © Springer Nature Switzerland AG 2018. This is an author produced version of a paper subsequently published in Integrated Formal Methods (LCS 11023). Uploaded in accordance with the publisher's self-archiving policy. |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 03 Oct 2018 14:33 |
Last Modified: | 04 Oct 2018 05:56 |
Published Version: | https://doi.org/10.1007/978-3-319-98938-9_7 |
Status: | Published |
Publisher: | Springer Verlag |
Series Name: | Lecture Notes in Computer Science |
Refereed: | Yes |
Identification Number: | 10.1007/978-3-319-98938-9_7 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:136601 |