TY - GEN
T1 - A generic logic for proving linearizability
AU - Khyzha, Artem
AU - Gotsman, Alexey
AU - Parkinson, Matthew
N1 - Publisher Copyright:
© Springer International Publishing AG 2016.
PY - 2016
Y1 - 2016
N2 - Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms, and recent years have seen a number of proposals of program logics for proving it. Although these logics differ in technical details, they embody similar reasoning principles. To explicate these principles, we propose a logic for proving linearizability that is generic: it can be instantiated with different means of compositional reasoning about concurrency, such as separation logic or relyguarantee. To this end, we generalise the Views framework for reasoning about concurrency to handle relations between programs, required for proving linearizability. We present sample instantiations of our generic logic and show that it is powerful enough to handle concurrent algorithms with challenging features, such as helping.
AB - Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms, and recent years have seen a number of proposals of program logics for proving it. Although these logics differ in technical details, they embody similar reasoning principles. To explicate these principles, we propose a logic for proving linearizability that is generic: it can be instantiated with different means of compositional reasoning about concurrency, such as separation logic or relyguarantee. To this end, we generalise the Views framework for reasoning about concurrency to handle relations between programs, required for proving linearizability. We present sample instantiations of our generic logic and show that it is powerful enough to handle concurrent algorithms with challenging features, such as helping.
UR - http://www.scopus.com/inward/record.url?scp=84996559105&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-48989-6_26
DO - 10.1007/978-3-319-48989-6_26
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84996559105
SN - 9783319489889
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 426
EP - 443
BT - FM 2016
A2 - Heitmeyer, Constance
A2 - Philippou, Anna
A2 - Gnesi, Stefania
A2 - Fitzgerald, John
PB - Springer Verlag
T2 - 21st International Symposium on Formal Methods, FM 2016
Y2 - 9 November 2016 through 11 November 2016
ER -