Abstraction for concurrent objects

DOI10.1016/j.tcs.2010.09.021zbMath1209.68156OpenAlexW2139533136MaRDI QIDQ615951

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

Publication date: 7 January 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.021

zbMATH Keywords

linearizabilitysequential consistencyobservational equivalenceobservational refinement

Mathematics Subject Classification ID

Data structures (68P05) Theory of software (68N99)

Related Items (19)

From Sequential Specifications to Eventual Consistency ⋮ On reducing linearizability to state reachability ⋮ Extending the wait-free hierarchy to multi-threaded systems ⋮ Decidability and complexity for quiescent consistency and its variations ⋮ A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures ⋮ Relating trace refinement and linearizability ⋮ Making Linearizability Compositional for Partially Ordered Executions ⋮ Higher-order linearisability ⋮ Quantifiability: a concurrent correctness condition modeled in vector space ⋮ On the complexity of linearizability ⋮ Proving Linearizability Using Partial Orders ⋮ A Sound Foundation for the Topological Approach to Task Solvability ⋮ Multi-shot distributed transaction commit ⋮ Unnamed Item ⋮ A Framework for Correctness Criteria on Weak Memory Models ⋮ Unnamed Item ⋮ Linearizability on hardware weak memory models ⋮ Unnamed Item ⋮ Strict Linearizability and Abstract Atomicity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fully abstract may testing semantics for concurrent objects
• Prespecification in data refinement
• LCF considered as a programming language
• Proof of correctness of data representations
• A unified theory of shared memory consistency
• Abstraction for Concurrent Objects
• The serializability of concurrent database updates
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Representation independence, confinement and access control [extended abstract]
• CONCUR 2004 - Concurrency Theory
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Abstraction for concurrent objects