Affiliation:
1. L.I.T.P. Univ. Paris 7, Paris, France
Abstract
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
.
Publisher
Association for Computing Machinery (ACM)
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. References;Foundations of Quantum Programming;2024
2. Distributed quantum programs;Foundations of Quantum Programming;2024
3. Verification of Distributed Quantum Programs;ACM Transactions on Computational Logic;2022-04-06
4. A component-based framework for certification of components in a cloud of HPC services;Science of Computer Programming;2020-06
5. Thirty-Seven Years of Relational Hoare Logic: Remarks on Its Principles and History;Leveraging Applications of Formal Methods, Verification and Validation: Engineering Principles;2020