Certification of an exact worst-case self-stabilization time
From MaRDI portal
Publication:2680867
DOI10.1016/j.tcs.2022.11.019OpenAlexW4309149074MaRDI QIDQ2680867
Karine Altisen, Stéphane Devismes, Pierre Corbineau
Publication date: 4 January 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.019
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Impossibility of gathering, a certification
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- The verified incremental design of a distributed spanning tree algorithm: Extended abstract
- Formal techniques for distributed objects, components, and systems. 39th IFIP WG 6.1 international conference, FORTE 2019, held as part of the 14th international federated conference on distributed computing techniques, DisCoTec 2019, Kongens Lyngby, Denmark, June 17--21, 2019. Proceedings
- A Framework for Certified Self-Stabilization
- Formal Verification of Distributed Algorithms
- Self-stabilizing systems in spite of distributed control
- TLA + Proofs
- Introduction to Distributed Self-Stabilizing Algorithms
This page was built for publication: Certification of an exact worst-case self-stabilization time