Derrick, J., Smith, G. and Dongol, B. (2014) Verifying Linearizability on TSO Architectures. In: Integrated Formal Methods. IFM: International Conference on Integrated Formal Methods. iFM 2014: The 11th International Conference on Integrated Formal Methods, 09/09/2014-11/09/2014, Bertinoro, Italy. Lecture Notes in Computer Science , 8739 . Springer Verlag , pp. 341-356. ISBN 978-3-319-10180-4
Abstract
Linearizability is the standard correctness criterion for fine-grained, non-atomic concurrent algorithms, and a variety of methods for verifying linearizability have been developed. However, most approaches assume a sequentially consistent memory model, which is not always realised in practice. In this paper we define linearizability on a weak memory model: the TSO (Total Store Order) memory model, which is implemented in the x86 multicore architecture. We also show how a simulation-based proof method can be adapted to verify linearizability for algorithms running on TSO architectures. We demonstrate our approach on a typical concurrent algorithm, spinlock, and prove it linearizable using our simulation-based approach. Previous approaches to proving linearizabilty on TSO architectures have required a modification to the algorithm’s natural abstract specification. Our proof method is the first, to our knowledge, for proving correctness without the need for such modification.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2014 Springer. This is an author produced version of a paper subsequently published in Integrated Formal Methods. IFM: International Conference on Integrated Formal Methods. Uploaded in accordance with the publisher's self-archiving policy. |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 19 May 2017 14:27 |
Last Modified: | 22 Mar 2018 12:29 |
Published Version: | https://doi.org/10.1007/978-3-319-10181-1_21 |
Status: | Published |
Publisher: | Springer Verlag |
Series Name: | Lecture Notes in Computer Science |
Refereed: | Yes |
Identification Number: | 10.1007/978-3-319-10181-1_21 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:113095 |