Download:
|
by I. S. W. B. Prasetya, I. S. W. B. Prasetya, I. S. W. B. Prasetya, S. D. Swierstra, S. D. Swierstra, S. D. Swierstra
http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-1995/1995-07.ps.gz
Add To MetaCart
Abstract:
Experience has shown that reasoning informally about distributed algorithms is extremely dangerous and error-prone, although the underlying method of reasoning is appealing. On the other hand, completely formal proofs of even simple algorithms are tedious to construct and difficult to follow. In this paper we propose a number of new operators for the UNITY logic, which enable us to reason completely formal about self-stabilizing algorithms, while maintaining the structures which play a role in the development of the algorithm. The paper includes some examples in which we show how various laws are used, and how design strategies can be represented in formal structures. 1
Citations
|
693
|
Parallel Program Design { A Foundation
– Chandy, Misra
- 1988
|
|
449
|
Self-Stabilizing Systems in Spite of Distributed Control
– Dijkstra
- 1974
|
|
119
|
Distributed reset
– Arora, Gouda
- 1994
|
|
98
|
Introduction to HOL
– Gordon, Melham
- 1993
|
|
95
|
Uniform self-stabilizing rings
– Burns, Pachl
- 1989
|
|
79
|
Closure and convergence: A foundation of fault-tolerant computing
– Arora, Gouda
- 1993
|
|
47
|
Eliminating the substitution axiom from UNITY logic
– Sanders
- 1991
|
|
42
|
A self-stabilizing algorithm for constructing spanning trees
– Chen, Yu, et al.
- 1991
|
|
41
|
Self-stabilization (in spite of distributed control
– Kruijer
- 1979
|
|
25
|
A Theorem Prover for UNITY in Higher Order Logic
– Andersen
- 1992
|
|
25
|
Adaptive programming
– Gouda, Herman
- 1991
|
|
16
|
Adaptivity through distributed convergence
– Herman
- 1991
|
|
15
|
Self-stabilization of the alternating-bit protocol
– Afek, Brown
- 1989
|
|
7
|
Self-stabilization of dynamic systems
– Dolev, Israeli, et al.
- 1990
|
|
7
|
Leads-to and program union
– Singh
- 1989
|
|
5
|
Towards the formal design of self-stabilizing distributed algorithms
– Lentfert, Swierstra
- 1993
|
|
5
|
Formalization of variables access constraints to support compositionality of liveness properties
– Prasetya
- 1993
|
|
4
|
Distributed Hierarchical Algorithms
– Lentfert
- 1993
|
|
4
|
Compositional local progress in unity
– Udink, Herman, et al.
- 1994
|
|
3
|
UU UNITY: a Mechanical Proving Environment for UNITY Logic
– Prasetya
- 1993
|
|
1
|
Towards a mechanically supported and compositional calculus to design distributed algorithms
– Prasetya
- 1994
|
|
1
|
Lifted Predicate Calculus in HOL
– Prestya
- 1993
|
