Pages that link to "Item:Q1125687"
From MaRDI portal
The following pages link to The verified incremental design of a distributed spanning tree algorithm: Extended abstract (Q1125687):
Displaying 9 items.
- Theories for mechanical proofs of imperative programs (Q1267030) (← links)
- A principle for sequential reasoning about distributed algorithms (Q1346611) (← links)
- A mechanical proof of Segall's PIF algorithm (Q1362774) (← links)
- An algebraic framework for minimum spanning tree problems (Q1786562) (← links)
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos (Q2377304) (← links)
- Certification of an exact worst-case self-stabilization time (Q2680867) (← links)
- Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm (Q3179390) (← links)
- Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks (Q5445768) (← links)
- Randomized Lower Bound for Distributed Spanning-Tree Verification (Q5496155) (← links)