On Certifying Distributed Algorithms: Problem of Local Correctness - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

On Certifying Distributed Algorithms: Problem of Local Correctness

Abstract

A certifying distributed algorithm (CDA) is a runtime verification method for distributed systems. Additionally to each output, a CDA computes a witness – a correctness argument for the particular output. If the witness is verified at runtime, the output is correct. The output is distributed over the system with each component holding its part of the distributed output.In this paper, we investigate the case where the verification at runtime fails. Assume one component computes its part of the distributed output incorrectly. As a consequence, the distributed output is incorrect and the verification fails. Some components may still hold a correct part of the output. That is why we introduce the problem of local correctness of a component: Is a component’s part of the output correct? As a case study, we investigate local correctness for a CDA computing shortest paths as used in distance-vector routing.
Fichier principal
Vignette du fichier
478668_1_En_16_Chapter.pdf (287.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02313747 , version 1 (11-10-2019)

Licence

Attribution

Identifiers

Cite

Kim Völlinger. On Certifying Distributed Algorithms: Problem of Local Correctness. 39th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE), Jun 2019, Copenhagen, Denmark. pp.281-288, ⟨10.1007/978-3-030-21759-4_16⟩. ⟨hal-02313747⟩
25 View
12 Download

Altmetric

Share

Gmail Facebook X LinkedIn More