Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(4)
Concurrent Data Structures
Observational Equivalence
Satisfiability
Sequential Consistency
Subscribe
Academic
Publications
Abstraction for concurrent objects
Abstraction for concurrent objects,10.1016/j.tcs.2010.09.021,Theoretical Computer Science,Ivana Filipovic,Peter W. O'Hearn,Noam Rinetzky,Hongseok Yang
Edit
Abstraction for concurrent objects
(
Citations: 1
)
BibTex
|
RIS
|
RefWorks
Download
Ivana Filipovic
,
Peter W. O'Hearn
,
Noam Rinetzky
,
Hongseok Yang
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.
Journal:
Theoretical Computer Science - TCS
, vol. 411, no. 51-52, pp. 4379-4398, 2010
DOI:
10.1016/j.tcs.2010.09.021
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.sciencedirect.com
)
(
www.informatik.uni-trier.de
)
(
dx.doi.org
)
Citation Context
(1)
...It is related to Theorems 13.3-5 of N. Lynch’s book [14] (see also [13]) as well as to the embedding of linearizability into observational refinement given in [
7
]...
John Derrick
,
et al.
Verifying Linearisability with Potential Linearisation Points
References
(16)
Lazy caching
(
Citations: 93
)
Yehuda Afek
,
Geoffrey M. Brown
,
Michael Merritt
Journal:
ACM Transactions on Programming Languages and Systems - TOPLAS
, vol. 15, no. 1, pp. 182-205, 1993
Concurrency Control and Recovery in Database Systems
(
Citations: 2844
)
Philip A. Bernstein
,
Vassos Hadzilacos
,
Nathan Goodman
Published in 1987.
A Grainless Semantics for Parallel Programs with Shared Mutable Data
(
Citations: 13
)
Stephen Brookes
Journal:
Electronic Notes in Theoretical Computer Science - ENTCS
, vol. 155, pp. 277-307, 2006
Characterization of a Sequentially Consistent Memory and Verification of a Cache Memory by Abstraction
(
Citations: 23
)
Susanne Graf
Journal:
Distributed Computing - DC
, vol. 12, no. 2-3, pp. 75-90, 1999
The art of multiprocessor programming
(
Citations: 121
)
Maurice Herlihy
,
Nir Shavit
Published in 2008.
Sort by:
Citations
(1)
Verifying Linearisability with Potential Linearisation Points
(
Citations: 1
)
John Derrick
,
Gerhard Schellhorn
,
Heike Wehrheim