Skip to Main content Skip to Navigation
Conference papers

Tasks in Modular Proofs of Concurrent Algorithms

Abstract : Proving correctness of distributed or concurrent algorithms is a mind-challenging and complex process. Slight errors in the reasoning are difficult to find, calling for computer-checked proof systems. In order to build computer-checked proofs with usual tools, such as Coq or TLA+, having sequential specifications of all base objects that are used as building blocks in a given algorithm is a requisite to provide a modular proof built by composition. Alas, many concurrent objects do not have a sequential specification.This article describes a systematic method to transform any task, a specification method that captures concurrent one-shot distributed problems, into a sequential specification involving two calls, set and get. This transformation allows system designers to compose proofs, thus providing a framework for modular computer-checked proofs of algorithms designed using tasks and sequential objects as building blocks. The Moir&Anderson implementation of renaming using splitters is an iconic example of such algorithms designed by composition.
Complete list of metadata

Cited literature [39 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Monday, July 20, 2020 - 3:27:17 PM
Last modification on : Wednesday, June 9, 2021 - 10:00:27 AM
Long-term archiving on: : Tuesday, December 1, 2020 - 1:44:05 AM


Files produced by the author(s)



Armando Castañeda, Aurélie Hurault, Philippe Quéinnec, Matthieu Roy. Tasks in Modular Proofs of Concurrent Algorithms. 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019), Oct 2019, Pisa, Italy. pp.69-83, ⟨10.1007/978-3-030-34992-9_6⟩. ⟨hal-02903005⟩



Record views


Files downloads