Abstraction for concurrent objects

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

doi:10.1007/978-3-642-00590-9_19

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: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

30 Scopus citations

Abstract

Concurrent data structures are usually designed to satisfy correctness conditions such as sequential consistency and 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
Title of host publication	Programming Languages and Systems - 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, Proceedings
Pages	252-266
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-00590-9_19
State	Published - 2009
Externally published	Yes
Event	18th European Symposium on Programming, ESOP 2009 - York, United Kingdom Duration: 22 Mar 2009 → 29 Mar 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5502
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	18th European Symposium on Programming, ESOP 2009
Country/Territory	United Kingdom
City	York
Period	22/03/09 → 29/03/09

Funding

Funders	Funder number
Engineering and Physical Sciences Research Council
Royal Society

Access to Document

10.1007/978-3-642-00590-9_19

Cite this

Filipović, I., O'Hearn, P., Rinetzky, N., & Yang, H. (2009). Abstraction for concurrent objects. In Programming Languages and Systems - 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, Proceedings (pp. 252-266). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5502). https://doi.org/10.1007/978-3-642-00590-9_19

Filipović, Ivana ; O'Hearn, Peter ; Rinetzky, Noam et al. / Abstraction for concurrent objects. Programming Languages and Systems - 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, Proceedings. 2009. pp. 252-266 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{34ddd522ff4f45d78705d0c437127513,

title = "Abstraction for concurrent objects",

abstract = "Concurrent data structures are usually designed to satisfy correctness conditions such as sequential consistency and 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.",

author = "Ivana Filipovi{\'c} 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.; 18th European Symposium on Programming, ESOP 2009 ; Conference date: 22-03-2009 Through 29-03-2009",

year = "2009",

doi = "10.1007/978-3-642-00590-9_19",

language = "אנגלית",

isbn = "9783642005893",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "252--266",

booktitle = "Programming Languages and Systems - 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, Proceedings",

}

Filipović, I, O'Hearn, P, Rinetzky, N & Yang, H 2009, Abstraction for concurrent objects. in Programming Languages and Systems - 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5502, pp. 252-266, 18th European Symposium on Programming, ESOP 2009, York, United Kingdom, 22/03/09. https://doi.org/10.1007/978-3-642-00590-9_19

Abstraction for concurrent objects. / Filipović, Ivana; O'Hearn, Peter; Rinetzky, Noam et al.
Programming Languages and Systems - 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, Proceedings. 2009. p. 252-266 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5502).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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 - 2009

Y1 - 2009

N2 - Concurrent data structures are usually designed to satisfy correctness conditions such as sequential consistency and 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 and 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.

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

U2 - 10.1007/978-3-642-00590-9_19

DO - 10.1007/978-3-642-00590-9_19

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:67650134647

SN - 9783642005893

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 252

EP - 266

BT - Programming Languages and Systems - 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, Proceedings

T2 - 18th European Symposium on Programming, ESOP 2009

Y2 - 22 March 2009 through 29 March 2009

ER -

Filipović I, O'Hearn P, Rinetzky N, Yang H. Abstraction for concurrent objects. In Programming Languages and Systems - 18th European Symposium on Programming, ESOP 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, Proceedings. 2009. p. 252-266. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-00590-9_19

Abstraction for concurrent objects

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this