Pages that link to "Item:Q5271049"
From MaRDI portal
The following pages link to Quantitative Reasoning for Proving Lock-Freedom (Q5271049):
Displaying 4 items.
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- Modular Termination Verification for Non-blocking Concurrency (Q2802477) (← links)
- A Higher-Order Logic for Concurrent Termination-Preserving Refinement (Q2988673) (← links)
- Two decades of automatic amortized resource analysis (Q5875892) (← links)
