Correctness Proof for a Network Synchronizer
In this paper we offer a formal, rigorous proof of the correctness of Awerbuch's algorithm for network synchronization [1]. We specify both the algorithm and the correctness condition using the I/O automaton model.
Main Authors: | Devarajan, Harish, Fekete, Alan, Lynch, Nancy A., Shrira, Liuba |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149753 |
Similar Items
-
A Modular Proof of Correctness for a Network Synchronizer
by: Fekete, A., et al.
Published: (2023) -
Efficient At-most-once Messages Based on Synchronized Clocks
by: Liskov, Barbara, et al.
Published: (2023) -
Hierarchical Correctness Proofs for Distributed Algorithms
by: Lynch, Nancy A., et al.
Published: (2023) -
Opportunistic Log: Efficient Installation Reads in a Reliable Object Server
by: O'Toole, James, et al.
Published: (2023) -
A Hundred Impossibility Proofs for Distributed Computing
by: Lynch, Nancy A.
Published: (2023)