Evènement pour le groupe Algorithmique Distribuée

Date 2016-05-02  14:00-15:00
TitreA General Framework for Reusing Proofs of Termination Detection by Refinement-Based Compositions 
RésuméWe propose a formal framework enhancing the termination detection property of distributed algorithms and reusing their specifications as well as their proofs. By relying on refinement and composition, we show that an algorithm specified with local termination detection, can be reused in order to compute the same algorithm with global termination detection. The main idea relies upon the development of distributed algorithms following a top/down approach and the integration of additional computation steps developed in a pre-defined module. This module is specified in a generic and scalable way in order to be composed with particular developments. Once the composition link is proven, the global termination emerges automatically. This work is done within the DAMPAS project.  
OrateurMaha Boussabbeh 

Aucun document lié à cet événement.

Retour à l'index