Abstraction for concurrent objects
From MaRDI portal
Publication:615951
DOI10.1016/J.TCS.2010.09.021zbMATH Open1209.68156OpenAlexW2139533136MaRDI QIDQ615951FDOQ615951
Authors: 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
Recommendations
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?)
- Characterization of a sequentially consistent memory and verification of a cache memory by abstraction
- Proving refinement using transduction
Cited In (27)
- Higher-order linearisability
- Strict linearizability and abstract atomicity
- Multi-shot distributed transaction commit
- Hybrid concurrency control for abstract data types
- Abstraction over implementation structure with symmetrically encapsulated multimethods
- Relative Store Fragments for Singleton Abstraction
- Title not available (Why is that?)
- Abstraction for Concurrent Objects
- Quantifiability: a concurrent correctness condition modeled in vector space
- An epistemic perspective on consistency of concurrent computations
- Title not available (Why is that?)
- Extending the wait-free hierarchy to multi-threaded systems
- Title not available (Why is that?)
- A sound and complete proof technique for linearizability of concurrent data structures
- Characterizing progress properties of concurrent objects via contextual refinements
- A Sound Foundation for the Topological Approach to Task Solvability
- Logical concurrency control from sequential proofs
- Decidability and complexity for quiescent consistency and its variations
- A framework for correctness criteria on weak memory models
- From sequential specifications to eventual consistency
- Linearizability on hardware weak memory models
- Quarantining weakness. Compositional reasoning under relaxed memory models (extended abstract)
- Making Linearizability Compositional for Partially Ordered Executions
- Proving linearizability using partial orders
- On the complexity of linearizability
- Higher-order linearisability
- Relating trace refinement and linearizability
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)
