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

Abstraction for concurrent objects   (Citations: 1)
BibTex | RIS | RefWorks Download
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
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.
Sort by: