Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/11530
Title: Verifying linearisability: A comparative survey
Authors: Dongol, B
Derrick, J
Keywords: Linearisability;concurrent objects;refinement;compositional proofs;shape analysis;Reduction;Abstraction;Interval-based methods;Mechanisation
Issue Date: 2015
Publisher: The Association for Computing Machinery
Citation: ACM Computing Surveys, 48(2): 19, (2015)
Abstract: Linearisability is a key correctness criterion for concurrent data structures, ensuring that each history of the concurrent object under consideration is consistent with respect to a history of the corresponding abstract data structure. Linearisability allows concurrent (i.e., overlapping) operation calls to take effect in any order, but requires the real-time order of nonoverlapping to be preserved. The sophisticated nature of concurrent objects means that linearisability is difficult to judge, and hence, over the years, numerous techniques for verifying lineasizability have been developed using a variety of formal foundations such as data refinement, shape analysis, reduction, etc. However, because the underlying framework, nomenclature, and terminology for each method is different, it has become difficult for practitioners to evaluate the differences between each approach, and hence, evaluate the methodology most appropriate for verifying the data structure at hand. In this article, we compare the major of methods for verifying linearisability, describe the main contribution of each method, and compare their advantages and limitations.
URI: http://dl.acm.org/citation.cfm?doid=2830539.2796550
http://bura.brunel.ac.uk/handle/2438/11530
DOI: http://dx.doi.org/10.1145/2796550
ISSN: 0360-0300
1557-7341
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf456.89 kBUnknownView/Open


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