The following pages link to Abstraction for concurrent objects (Q615951):
Displaying 18 items.
- Linearizability on hardware weak memory models (Q782494) (← links)
- On reducing linearizability to state reachability (Q1641012) (← links)
- Decidability and complexity for quiescent consistency and its variations (Q1680503) (← links)
- Relating trace refinement and linearizability (Q1688548) (← links)
- Multi-shot distributed transaction commit (Q1981633) (← links)
- Extending the wait-free hierarchy to multi-threaded systems (Q2166369) (← links)
- On the complexity of linearizability (Q2218465) (← links)
- Higher-order linearisability (Q2423744) (← links)
- A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures (Q2946743) (← links)
- Proving Linearizability Using Partial Orders (Q2988662) (← links)
- From Sequential Specifications to Eventual Consistency (Q3449480) (← links)
- (Q5091106) (← links)
- (Q5111648) (← links)
- (Q5155670) (← links)
- A Framework for Correctness Criteria on Weak Memory Models (Q5206951) (← links)
- Strict Linearizability and Abstract Atomicity (Q5859670) (← links)
- A Sound Foundation for the Topological Approach to Task Solvability (Q5875396) (← links)
- Quantifiability: a concurrent correctness condition modeled in vector space (Q6161035) (← links)
