Abstraction for concurrent objects

Ivana Filipovi; Peter O'Hearn; Noam Rinetzky; Hongseok Yang

doi:10.1016/j.tcs.2010.09.021

Abstraction for concurrent objects

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

^*Corresponding author for this work

Queen Mary University of London

Research output: Contribution to journal › Article › peer-review

110 Scopus citations

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 language	English
Pages (from-to)	4379-4398
Number of pages	20
Journal	Theoretical Computer Science
Volume	411
Issue number	51-52
DOIs	https://doi.org/10.1016/j.tcs.2010.09.021
State	Published - 4 Dec 2010
Externally published	Yes

Funding

Funders	Funder number
Engineering and Physical Sciences Research Council	EP/D053625/1, EP/E053041/1
Royal Society

Keywords

Linearizability
Observational equivalence
Observational refinement
Sequential consistency

Access to Document

10.1016/j.tcs.2010.09.021

Cite this

@article{fe6d759ab1894fe6ba1a78dae66be5af,

title = "Abstraction for concurrent objects",

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.",

keywords = "Linearizability, Observational equivalence, Observational refinement, Sequential consistency",

author = "Ivana Filipovi and Peter O'Hearn and Noam Rinetzky and Hongseok Yang",

note = "Funding Information: We thank the anonymous referees of this paper and the anonymous referees of the ESOP{\textquoteright}09 paper [7] for helping us to improve this work; Viktor Vafeiadis and Matthew Parkinson for useful comments; and Ugo Montanari, Julian Rathke and Matthew Hennessy for pointing out related work. We acknowledge the support of the EPSRC. O{\textquoteright}Hearn acknowledges the support of a Royal Society Wolfson Research Merit Award.",

year = "2010",

month = dec,

day = "4",

doi = "10.1016/j.tcs.2010.09.021",

language = "אנגלית",

volume = "411",

pages = "4379--4398",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "51-52",

}

TY - JOUR

T1 - Abstraction for concurrent objects

AU - Filipovi, Ivana

AU - O'Hearn, Peter

AU - Rinetzky, Noam

AU - Yang, Hongseok

N1 - Funding Information: We thank the anonymous referees of this paper and the anonymous referees of the ESOP’09 paper [7] for helping us to improve this work; Viktor Vafeiadis and Matthew Parkinson for useful comments; and Ugo Montanari, Julian Rathke and Matthew Hennessy for pointing out related work. We acknowledge the support of the EPSRC. O’Hearn acknowledges the support of a Royal Society Wolfson Research Merit Award.

PY - 2010/12/4

Y1 - 2010/12/4

N2 - 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.

AB - 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.

KW - Linearizability

KW - Observational equivalence

KW - Observational refinement

KW - Sequential consistency

UR - http://www.scopus.com/inward/record.url?scp=78649324033&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2010.09.021

DO - 10.1016/j.tcs.2010.09.021

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:78649324033

SN - 0304-3975

VL - 411

SP - 4379

EP - 4398

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 51-52

ER -

Abstraction for concurrent objects

Abstract

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this