Pages that link to "Item:Q5410705"
From MaRDI portal
The following pages link to Communicating State Transition Systems for Fine-Grained Concurrent Resources (Q5410705):
Displayed 14 items.
- Correctness and concurrent complexity of the black-white bakery algorithm (Q736464) (← links)
- Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper) (Q832157) (← links)
- A perspective on specifying and verifying concurrent modules (Q1648035) (← links)
- Improving thread-modular abstract interpretation (Q2145342) (← links)
- Caper (Q2988651) (← links)
- A Higher-Order Logic for Concurrent Termination-Preserving Refinement (Q2988673) (← links)
- Abstract Specifications for Concurrent Maps (Q2988678) (← links)
- Verifying Concurrent Graph Algorithms (Q3179300) (← links)
- Iris from the ground up: A modular foundation for higher-order concurrent separation logic (Q4625160) (← links)
- Aneris: A Mechanised Logic for Modular Reasoning about Distributed Systems (Q5041100) (← links)
- (Q5094146) (← links)
- Steps in modular specifications for concurrent modules (invited tutorial paper) (Q5971389) (← links)
- Concise outlines for a complex logic: a proof outline checker for TaDA (Q6145023) (← links)
- A fine-grained semantics for arrays and pointers under weak memory models (Q6174541) (← links)