Proving Correctness of Highly-Concurrent Linearisable Objects - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Proving Correctness of Highly-Concurrent Linearisable Objects

Résumé

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.

Mots clés

Fichier principal
Vignette du fichier
PPoPP-2006-listRG.pdf (179.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01248204 , version 1 (24-12-2015)

Identifiants

Citer

Viktor Vafeiadis, Maurice Herlihy, Tony Car Hoare 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⟩
124 Consultations
442 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More