Abstraction for concurrent objects

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publicationProgramming 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
Number of pages15
StatePublished - 2009
Externally publishedYes
Event18th European Symposium on Programming, ESOP 2009 - York, United Kingdom
Duration: 22 Mar 200929 Mar 2009

Publication series

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


Conference18th European Symposium on Programming, ESOP 2009
Country/TerritoryUnited Kingdom


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

Cite this