Proving correctness of CSP programs, a tutorial
Proc. of the NATO Advanced Study Institute on Control flow and data flow: concepts of distributed programming
Real time clocks versus virtual clocks
Proc. of the NATO Advanced Study Institute on Control flow and data flow: concepts of distributed programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Communicating sequential processes
Communications of the ACM
How to cook a temporal proof system for your pet language
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Distributed Termination with Interval Assertions
Proceedings of the International Colloquium on Formalization of Programming Concepts
A verification helper for task specifications
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Distributed termination detection for dynamic systems
Parallel Computing
Non-Intrusive Detection of Synchronization Errors Using Execution Replay
Automated Software Engineering
Design and verification of fault tolerant systems with CSP
Distributed Computing
| Hi-index | 0.00 |
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.