A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Correctness Proofs of Distributed Termination Algorithms
[chapter]
1985
Logics and Models of Concurrent Systems
Preserved Fulltext
The problem of correctness of the solutions to the distributed termination problem of Francez [7] is addressed. Correctness criteria are formalized in the customary framework for program correctness. A very simple proof method is proposed and applied to show correctness of a solution to the problem. It allows us to reason about liveness properties of temporal logic (see, e.g., Manna and Pnueli [12]) using a new notion of weak total correctness. J is a global invariant of S. Observe now that J
doi:10.1007/978-3-642-82453-1_6
dblp:conf/nato/Apt84
fatcat:ij3u5rbxxjco3b73sn5rqkpeom