Recommendations
Cites work
- scientific article; zbMATH DE number 3924146 (Why is no real title available?)
- scientific article; zbMATH DE number 3943003 (Why is no real title available?)
- scientific article; zbMATH DE number 3947615 (Why is no real title available?)
- scientific article; zbMATH DE number 512792 (Why is no real title available?)
- scientific article; zbMATH DE number 821282 (Why is no real title available?)
- A fully abstract may testing semantics for concurrent objects
- A grainless semantics for parallel programs with shared mutable data
- A unified theory of shared memory consistency
- Abstraction for Concurrent Objects
- CONCUR 2004 - Concurrency Theory
- Characterization of a sequentially consistent memory and verification of a cache memory by abstraction
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
- LCF considered as a programming language
- Prespecification in data refinement
- Proof of correctness of data representations
- Proving refinement using transduction
- Representation independence, confinement and access control (extended abstract)
- The serializability of concurrent database updates
Cited in
(29)- Higher-order linearisability
- Hybrid concurrency control for abstract data types
- Multi-shot distributed transaction commit
- Strict linearizability and abstract atomicity
- Abstraction over implementation structure with symmetrically encapsulated multimethods
- Relative Store Fragments for Singleton Abstraction
- scientific article; zbMATH DE number 7561456 (Why is no real title available?)
- Abstraction for Concurrent Objects
- Quantifiability: a concurrent correctness condition modeled in vector space
- A compositional theory of linearizability
- An epistemic perspective on consistency of concurrent computations
- scientific article; zbMATH DE number 7407781 (Why is no real title available?)
- Extending the wait-free hierarchy to multi-threaded systems
- scientific article; zbMATH DE number 1546500 (Why is no real title available?)
- A sound and complete proof technique for linearizability of concurrent data structures
- Characterizing progress properties of concurrent objects via contextual refinements
- Decidability and complexity for quiescent consistency and its variations
- A Sound Foundation for the Topological Approach to Task Solvability
- Logical concurrency control from sequential proofs
- Linearizability on hardware weak memory models
- From sequential specifications to eventual consistency
- A framework for correctness criteria on 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
- Relating trace refinement and linearizability
- Higher-order linearisability
- Preserving hyperproperties of programs using primitives with consensus number 2
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)
