A Constructive Approach for Proving Data Structures' Linearizability

Abstract

We present a comprehensive methodology for proving correctness of concurrent data structures. We exemplify our methodology by using it to give a roadmap for proving linearizability of the popular Lazy List implementation of the concurrent set abstraction. Correctness is based on our key theorem, which captures sufficient conditions for linearizability. In contrast to prior work, our conditions are derived directly from the properties of the data structure in sequential runs, without requiring the linearization points to be explicitly identified.

DOI: 10.1007/978-3-662-48653-5_24

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{LevAri2015ACA, title={A Constructive Approach for Proving Data Structures' Linearizability}, author={Kfir Lev-Ari and Gregory V. Chockler and Idit Keidar}, booktitle={DISC}, year={2015} }