Pages that link to "Item:Q5261502"
From MaRDI portal
The following pages link to Proving that non-blocking algorithms don't block (Q5261502):
Displayed 12 items.
- Developments in concurrent Kleene algebra (Q299202) (← links)
- Balancing expressiveness in formal approaches to concurrency (Q890478) (← 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)
- RGITL: a temporal logic framework for compositional reasoning about interleaved programs (Q2251128) (← links)
- Rely-guarantee termination and cost analyses of loops with concurrent interleavings (Q2398172) (← links)
- Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems (Q2408742) (← links)
- Modular Termination Verification for Non-blocking Concurrency (Q2802477) (← links)
- Towards a Thread-Local Proof Technique for Starvation Freedom (Q2814127) (← links)
- Liveness-Preserving Atomicity Abstraction (Q3012940) (← links)
- Verifying Deadlock-Freedom of Communication Fabrics (Q3075484) (← links)
- A Machine-Checked Framework for Relational Separation Logic (Q3095237) (← links)
- Undecidability of Propositional Separation Logic and Its Neighbours (Q3189649) (← links)