Pages that link to "Item:Q5176190"
From MaRDI portal
The following pages link to Verifying linearizability with hindsight (Q5176190):
Displaying 12 items.
- On the relation between concurrent separation logic and concurrent Kleene algebra (Q2347904) (← 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)
- Abstract Specifications for Concurrent Maps (Q2988678) (← links)
- (Q5090915) (← links)
- (Q5111648) (← links)
- Comparison Under Abstraction for Verifying Linearizability (Q5429339) (← links)
- Tasks in modular proofs of concurrent algorithms (Q6044466) (← links)
- Make flows small again: revisiting the flow framework (Q6535380) (← links)
- Proving a non-blocking algorithm for process renaming with TLA\textsuperscript{+} (Q6536175) (← links)
- Tasks in modular proofs of concurrent algorithms (Q6536328) (← links)