Proving Correctness of Highly-Concurrent Linearisable Objects

Abstract : We study a family of implementations for linked lists using fine-grain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for classical, coarse-grain synchronisation. Our examples are demonstrative of common design patterns such as lock coupling, optimistic, and lazy synchronisation. Although they are are highly concurrent, we prove that they are linearisable, safe, and they correctly implement a high-level abstraction. Our proofs illustrate the power and applicability of rely-guarantee reasoning, as well of some of its limitations. The examples of the paper establish a benchmark challenge for other reasoning techniques.
Keywords : syn formel
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-01248204
Contributor : Alain Monteil <>
Submitted on : Thursday, December 24, 2015 - 9:43:08 AM
Last modification on : Thursday, March 21, 2019 - 1:07:00 PM

File

PPoPP-2006-listRG.pdf
Files produced by the author(s)

Identifiers

Citation

Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Marc Shapiro. Proving Correctness of Highly-Concurrent Linearisable Objects. PPoPP 2006 - 11th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Mar 2006, New York, United States. pp.129--136, ⟨10.1145/1122971.1122992⟩. ⟨hal-01248204⟩

Share

Metrics

Record views

177

Files downloads

236