Formal and Incremental Construction of Distributed Algorithms: On the Distributed Reference Counting Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2006

Formal and Incremental Construction of Distributed Algorithms: On the Distributed Reference Counting Algorithm

Abstract

The development of distributed algorithms and, more generally, distributed systems, is a complex, delicate and challenging process. Refinement techniques of (system) models improve the process by using a proof assistant, and by applying a design methodology aimed at starting from the most abstract model and leading, in an incremental way, to the most concrete model, for producing a distributed solution. We show, using the distributed reference counting (DRC) problem as our study, how models can be produced in an elegant and progressive way, thanks to the refinement and how the final distributed algorithm is built starting from these models. The development is carried out within the framework of the event B method and models are validated with a proof assistant.

Dates and versions

inria-00093164 , version 1 (12-09-2006)

Identifiers

Cite

Dominique Cansell, Dominique Méry. Formal and Incremental Construction of Distributed Algorithms: On the Distributed Reference Counting Algorithm. Theoretical Computer Science, 2006, ⟨10.1016/j.tcs.2006.08.015⟩. ⟨inria-00093164⟩
98 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More