Abstraction for concurrent objects
From MaRDI portal
Publication:615951
DOI10.1016/J.TCS.2010.09.021zbMATH Open1209.68156OpenAlexW2139533136MaRDI QIDQ615951FDOQ615951
Peter W. O'Hearn, Ivana Filipović, Noam Rinetzky, Hongseok Yang
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
Cites Work
- LCF considered as a programming language
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proof of correctness of data representations
- A grainless semantics for parallel programs with shared mutable data
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- CONCUR 2004 - Concurrency Theory
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- The serializability of concurrent database updates
- Representation independence, confinement and access control [extended abstract]
- Prespecification in data refinement
- A unified theory of shared memory consistency
- Title not available (Why is that?)
- A fully abstract may testing semantics for concurrent objects
- Abstraction for Concurrent Objects
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (23)
- Higher-order linearisability
- Multi-shot distributed transaction commit
- From Sequential Specifications to Eventual Consistency
- Hybrid concurrency control for abstract data types
- Abstraction over implementation structure with symmetrically encapsulated multimethods
- Relative Store Fragments for Singleton Abstraction
- Proving Linearizability Using Partial Orders
- Title not available (Why is that?)
- Quantifiability: a concurrent correctness condition modeled in vector space
- A Framework for Correctness Criteria on Weak Memory Models
- On reducing linearizability to state reachability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extending the wait-free hierarchy to multi-threaded systems
- Title not available (Why is that?)
- A Sound Foundation for the Topological Approach to Task Solvability
- Decidability and complexity for quiescent consistency and its variations
- Linearizability on hardware weak memory models
- Making Linearizability Compositional for Partially Ordered Executions
- Strict Linearizability and Abstract Atomicity
- On the complexity of linearizability
- Relating trace refinement and linearizability
- A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures
Recommendations
This page was built for publication: Abstraction for concurrent objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q615951)
