Proving Correctness of Highly-Concurrent Linearisable Objects - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

Proving Correctness of Highly-Concurrent Linearisable Objects

Viktor Vafeiadis
  • Function : Author
Maurice Herlihy
  • Function : Author
Tony Hoare
  • Function : Author
Marc Shapiro


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.
Fichier principal
Vignette du fichier
RR-5716.pdf (299.09 Ko) Télécharger le fichier

Dates and versions

inria-00070301 , version 1 (19-05-2006)


  • HAL Id : inria-00070301 , version 1


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⟩
166 View
17222 Download


Gmail Facebook Twitter LinkedIn More