Superimposition for interacting processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
A superimposition control construct for distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Trace Refinement of Action Systems
CONCUR '94 Proceedings of the Concurrency Theory
| Hi-index | 0.00 |
We present a structuring and verification method for distributed algorithms. The basic idea is that an algorithm to be verified is stepwise transformed into a high level specification through a number of steps, so-called coarsenings. At each step some mechanism of the algorithm is identified, verified and removed while the basic computation of the original algorithm is preserved. The method is based on a program development technique called superposition and it is formalized within the refinement calculus. We will show the usefulness of the method by verifying a complex distributed algorithm for minimum-hop route maintenance due to Chu.