Pages that link to "Item:Q3735060"
From MaRDI portal
The following pages link to Correctness proofs of distributed termination algorithms (Q3735060):
Displaying 10 items.
- Comments on ``On the proof of a distributed algorithm'': Always-true is not invariant (Q918207) (← links)
- Two normal form theorems for CSP programs (Q1094869) (← links)
- A fully distributed termination detection scheme (Q1111366) (← links)
- Design and verification of fault tolerant systems with CSP (Q1176076) (← links)
- Application of three-valued logic for distributed termination detection (Q1207442) (← links)
- An assertional proof of Rana's algorithm (Q1318748) (← links)
- A compositional framework for fault tolerance by specification transformation (Q1330423) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- The distributed termination problem: Formal solution and correctness based on Petri nets (Q3979267) (← links)
- A construction of distributed reference counting (Q5941636) (← links)