Abstraction for concurrent objects

DOI10.1016/j.tcs.2010.09.021zbMath1209.68156MaRDI 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

linearizability; sequential consistency; observational equivalence; observational refinement

Mathematics Subject Classification ID

68P05: Data structures

68N99: Theory of software

Related Items

Unnamed Item, Unnamed Item, A Framework for Correctness Criteria on Weak Memory Models, Strict Linearizability and Abstract Atomicity, Linearizability on hardware weak memory models, On reducing linearizability to state reachability, Decidability and complexity for quiescent consistency and its variations, Relating trace refinement and linearizability, Multi-shot distributed transaction commit, On the complexity of linearizability, Higher-order linearisability, A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures, Proving Linearizability Using Partial Orders, From Sequential Specifications to Eventual Consistency

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