Refinement Based Validation of an Algorithm for Detecting Distributed Termination

Authors:
Mamoun Filali;Philippe Mauran;Gérard Padiou;Philippe Quéinnec;Xavier Thirioux
Affiliations:
-;-;-;-;-
Venue:
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Year:
2000

Citing 5
Cited 2

Parallel program design: a foundation

Parallel program design: a foundation
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Forward and backward simulations I.: untimed systems

Information and Computation
The B-book: assigning programs to meanings

The B-book: assigning programs to meanings
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction

A Termination Detection Protocol for Use in Mobile Ad Hoc Networks

Automated Software Engineering
Tiered Algorithm for Distributed Process Quiescence and Termination Detection

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the development and the validation of an algorithm for detecting the termination of diffusing computations. To the best of our knowledge, this is the first one which is based on the maximal paths generated by a diffusing computation. After an informal presentation of the algorithm, we proceed to its rigorous development within the framework of the UNITY formalism and the assistance of the PVS proof system. The correctness of the algorithm is established through a refinement of an abstract model.