The verified incremental design of a distributed spanning tree algorithm: Extended abstract
From MaRDI portal
Publication:1125687
DOI10.1007/s001650050035zbMath0937.68111OpenAlexW2134831148MaRDI QIDQ1125687
Publication date: 2 January 2000
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://pure.rug.nl/ws/files/3164025/1999FormAspCompHesselink1.pdf
Related Items (6)
Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm ⋮ A mechanical proof of Segall's PIF algorithm ⋮ Certification of an exact worst-case self-stabilization time ⋮ An algebraic framework for minimum spanning tree problems ⋮ Theories for mechanical proofs of imperative programs
Uses Software
This page was built for publication: The verified incremental design of a distributed spanning tree algorithm: Extended abstract
