Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-02313747
Contributor : Hal Ifip <>
Submitted on : Friday, October 11, 2019 - 2:55:45 PM
Last modification on : Monday, June 15, 2020 - 12:00:34 PM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2022-01-01

Please log in to resquest access to the document

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

62