Output details
11 - Computer Science and Informatics
University College London
Article title
Abstraction for concurrent objects
Type
D - Journal article
Title of journal
Theoretical Computer Science
Article number
-
Volume number
411
Issue number
51-52
First page of article
4379
ISSN of journal
0304-3975
Year of publication
2010
URL
-
Number of additional authors
3
Additional information
<10>Invited submission to a special journal issue of (expanded versions of) selected papers from the 2009 European Symposium on Programming: 6 papers were invited, from the 26 papers accepted for the conference proceedings. A cross-culture paper connecting concepts from the programming theory and concurrent algorithms communities. The main theorem characterises linearizability, a favoured correctness condition in concurrent algorithms, in terms of observational refinement. This formally shows, for the first time, guarantees for client programs implied by proofs of highly concurrent objects. Opens up new lines on the long-delayed development of a theory of data abstraction for concurrency.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
11
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
