Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/9719
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Derrick, J | - |
dc.contributor.author | Smith, G | - |
dc.contributor.author | Dongol, B | - |
dc.date.accessioned | 2015-01-13T13:24:14Z | - |
dc.date.available | 2014 | - |
dc.date.available | 2015-01-13T13:24:14Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | Lecture Notes in Computer Science, 8739, pp. 341 - 356, 2014 | en_US |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://link.springer.com/chapter/10.1007%2F978-3-319-10181-1_21 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/9719 | - |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer Verlag | en_US |
dc.subject | Linearizability | en_US |
dc.subject | Consistent memory model | en_US |
dc.subject | TSO (Total Store Order) | en_US |
dc.subject | x86 multicore architecture | en_US |
dc.title | Verifying linearizability on TSO architectures | en_US |
dc.type | Article | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/978-3-319-10181-1_21 | - |
dc.relation.isPartOf | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.relation.isPartOf | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
pubs.organisational-data | /Brunel | - |
pubs.organisational-data | /Brunel/Brunel Staff by College/Department/Division | - |
pubs.organisational-data | /Brunel/Brunel Staff by College/Department/Division/College of Engineering, Design and Physical Sciences | - |
pubs.organisational-data | /Brunel/Brunel Staff by College/Department/Division/College of Engineering, Design and Physical Sciences/Dept of Computer Science | - |
pubs.organisational-data | /Brunel/Brunel Staff by College/Department/Division/College of Engineering, Design and Physical Sciences/Dept of Computer Science/Computer Science | - |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 240.42 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.