@inbook{ea8fa4b873fa4b6595030f9674f2d04e,
title = "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.",
author = "Kfir Lev-Ari and Gregory Chockler and Idit Keidar",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2015.; 29th International Symposium on Distributed Computing, DISC 2015 ; Conference date: 07-10-2015 Through 09-10-2015",
year = "2015",
doi = "https://doi.org/10.1007/978-3-662-48653-5_24",
language = "الإنجليزيّة",
isbn = "978-3-662-48652-8",
volume = "9363",
series = "Lecture Notes in Computer Science",
pages = "356--370",
editor = "Yoram Moses",
booktitle = "DISTRIBUTED COMPUTING (DISC 2015)",
}