Soham Chakraborty ; Thomas A. Henzinger ; Ali Sezgin ; Viktor Vafeiadis - Aspect-oriented linearizability proofs

lmcs:1051 - Logical Methods in Computer Science, April 1, 2015, Volume 11, Issue 1 -
Aspect-oriented linearizability proofsArticle

Authors: Soham Chakraborty ; Thomas A. Henzinger ; Ali Sezgin ; Viktor Vafeiadis ORCID

    Linearizability of concurrent data structures is usually proved by monolithic simulation arguments relying on the identification of the so-called linearization points. Regrettably, such proofs, whether manual or automatic, are often complicated and scale poorly to advanced non-blocking concurrency patterns, such as helping and optimistic updates. In response, we propose a more modular way of checking linearizability of concurrent queue algorithms that does not involve identifying linearization points. We reduce the task of proving linearizability with respect to the queue specification to establishing four basic properties, each of which can be proved independently by simpler arguments. As a demonstration of our approach, we verify the Herlihy and Wing queue, an algorithm that is challenging to verify by a simulation proof.

    Volume: Volume 11, Issue 1
    Published on: April 1, 2015
    Imported on: February 28, 2014
    Keywords: Computer Science - Logic in Computer Science,Computer Science - Programming Languages
      Source : OpenAIRE Graph
    • Quantitative Reactive Modeling; Funder: European Commission; Code: 267989
    • Semantic Foundations for Real-World Systems; Funder: UK Research and Innovation; Code: EP/H005633/1

    14 Documents citing this article

    Consultation statistics

    This page has been seen 1663 times.
    This article's PDF has been downloaded 565 times.