A mechanical proof of Segall's PIF algorithm

DOI10.1007/BF01211619zbMATH Open0874.68264OpenAlexW2074029023MaRDI QIDQ1362774FDOQ1362774

Authors: W. H. Hesselink 

Publication date: 10 November 1997

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01211619

Recommendations

• The verified incremental design of a distributed spanning tree algorithm: Extended abstract
• A computer checked algebraic verification of a distributed summation algorithm
• scientific article; zbMATH DE number 222692
• Formal Verification of Distributed Algorithms

zbMATH Keywords

distributed algorithmpropagation of information with feedback

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Distributed network protocols
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The verified incremental design of a distributed spanning tree algorithm: Extended abstract

Cited In (5)

• A computer checked algebraic verification of a distributed summation algorithm
• An assertional proof of Rana's algorithm
• Title not available (Why is that?)
• Assertion-Based Proof Checking of Chang-Roberts Leader Election in PVS
• Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos

Uses Software

• NQTHM
• UNITY

This page was built for publication: A mechanical proof of Segall's PIF algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362774)