Fairness
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
Extended naming conventions for communicating processes
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Performing remote operations efficiently on a local computer network
Performing remote operations efficiently on a local computer network
Verification of concurrent programs, Part I: The temporal framework
Verification of concurrent programs, Part I: The temporal framework
Verifying concurrent processes using temporal logic
Verifying concurrent processes using temporal logic
Reliability issues in distributed systems
Reliability issues in distributed systems
| Hi-index | 0.00 |
In this paper, we view computer networks as distributed systems that provide their users with a set of services, in a way which hides the distinction between those services which are local and those which are remote. We conceive of a given target network configuration as a network of communicating virtual machines and its behavior is modelled by a system of communicating sequential processes. Network protocols are described by a high level concurrent language (CSP) and a methodology is developed which permits the verification of partial and total correctness assertions about the system in a simple and natural way. Global invariants are used to establish invariant properties of the whole system and histories to record the sequence of communication exchanges between every matching pair of processes. Eventuality properties are expressed using linear temporal logic.