Proving Correctness of Highly-Concurrent Linearisable Objects

Viktor Vafeiadis Maurice Herlihy Tony Hoare Marc Shapiro 1
1 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
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.
Document type :
Reports
Complete list of metadatas

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070301
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 7:58:10 PM
Last modification on : Thursday, March 21, 2019 - 12:58:59 PM
Long-term archiving on : Sunday, April 4, 2010 - 7:53:42 PM

Identifiers

  • HAL Id : inria-00070301, version 1

Citation

Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Marc Shapiro. Proving Correctness of Highly-Concurrent Linearisable Objects. [Research Report] RR-5716, INRIA. 2005, pp.20. ⟨inria-00070301⟩

Share

Metrics

Record views

328

Files downloads

343