Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/10220
Title: Using coarse-grained abstractions to verify linearizability on TSO architectures
Authors: Derrick, J
Smith, G
Groves, L
Dongol, B
Keywords: Linearizability;TSO (Total Store Order) memory model
Issue Date: 2014
Publisher: Springer Verlag
Citation: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8855, 2014
Abstract: Most approaches to verifying linearizability assume a sequentially consistent memory model, which is not always realised in practice. In this paper we study correctness on a weak memory model: the TSO (Total Store Order) memory model, which is implemented in x86 multicore architectures. Our central result is a proof method that simplifies proofs of linearizability on TSO. This is necessary since the use of local buffers in TSO adds considerably to the verification overhead on top of the already subtle linearizability proofs. The proof method involves constructing a coarse-grained abstraction as an intermediate layer between an abstract description and the concurrent algorithm. This allows the linearizability proof to be split into two smaller components, where the effect of the local buffers in TSO is dealt with at a higher level of abstraction than it would have been otherwise.
URI: http://bura.brunel.ac.uk/handle/2438/10220
ISBN: 9783319133379
ISSN: 1611-3349
Appears in Collections:Dept of Electronic and Computer Engineering Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf257.24 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.