Abstraction for concurrent objects

Ivana Filipovi, Peter O'Hearn, Noam Rinetzky*, Hongseok Yang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Concurrent data structures are usually designed to satisfy correctness conditions such as sequential consistency or linearizability. In this paper, we consider the following fundamental question: What guarantees are provided by these conditions for client programs? We formally show that these conditions can be characterized in terms of observational refinement. Our study also provides a new understanding of sequential consistency and linearizability in terms of abstraction of dependency between computation steps of client programs.

Original languageEnglish
Pages (from-to)4379-4398
Number of pages20
JournalTheoretical Computer Science
Volume411
Issue number51-52
DOIs
StatePublished - 4 Dec 2010
Externally publishedYes

Funding

FundersFunder number
Engineering and Physical Sciences Research CouncilEP/D053625/1, EP/E053041/1
Royal Society

    Keywords

    • Linearizability
    • Observational equivalence
    • Observational refinement
    • Sequential consistency

    Fingerprint

    Dive into the research topics of 'Abstraction for concurrent objects'. Together they form a unique fingerprint.

    Cite this