Paper Info
Title
On Reducing Linearizability to State Reachability.
Abstract
Efficient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortunately their correctness criteria -- linearizability with respect to given ADT specifications -- are hard to verify. Even on classes of implementations where the usual temporal safety properties like control-state reachability are decidable, linearizability is undecidable. In this work we demonstrate that verifying linearizability for certain fixed ADT specifications is reducible to control-state reachability, despite being harder for arbitrary ADTs. We effectuate this reduction for several of the most popular atomic objects. This reduction yields the first decidability results for verification without bounding the number of concurrent threads. Furthermore, it enables the application of existing safety-verification tools to linearizability verification.
Year
DOI
Venue
2015
10.1016/j.ic.2018.02.014
Inf. Comput.
Field
DocType
Volume
Linearizability,Discrete mathematics,Computer science,Correctness,Thread (computing),Decidability,Reachability,Regular language,Bounding overwatch,Undecidable problem
Journal
261
Issue
ISSN
Citations 
Part
0890-5401
4
PageRank 
References 
Authors
0.40
11
4
Name
Order
Citations
PageRank
Ahmed Bouajjani12663184.84
Michael Emmi236521.76
Constantin Enea324926.95
Jad Hamza4716.44