Pages that link to "Item:Q666004"
From MaRDI portal
The following pages link to A scalable lock-free stack algorithm (Q666004):
Displayed 12 items.
- Proving linearizability with temporal logic (Q539223) (← links)
- Trace-based derivation of a scalable lock-free stack algorithm (Q1019022) (← links)
- Relating trace refinement and linearizability (Q1688548) (← links)
- Common2 extended to stacks and unbounded concurrency (Q1954246) (← links)
- Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free (Q2058383) (← links)
- Bounded-wait combining: constructing robust and high-throughput shared objects (Q2377268) (← links)
- Fast and scalable rendezvousing (Q2441532) (← links)
- Liveness-Preserving Atomicity Abstraction (Q3012940) (← links)
- (Q5155670) (← links)
- Tasks in modular proofs of concurrent algorithms (Q6044466) (← links)
- Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity (Q6099028) (← links)
- Quantifiability: a concurrent correctness condition modeled in vector space (Q6161035) (← links)