Computer networks
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Verification of Concurrent Programs: Temporal Proof Principles
Logic of Programs, Workshop
An interval logic for higher-level temporal reasoning
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Real-time programming and asynchronous message passing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A hardware semantics based on temporal intervals
A hardware semantics based on temporal intervals
Specification and verification of active message systems
SIGSMALL '90 Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems
Design and analysis of dynamic leader election protocols in broadcast networks
Distributed Computing
Coherence Ordering for Ring-based Chip Multiprocessors
Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture
| Hi-index | 0.01 |
We examine local area network protocols and verify the correctness of two representative algorithms using temporal logic. We introduce an interval temporal logic that allows us to make assertions of the form “in the next k units, X holds.” This logic encodes intuitive arguments about contention protocols quite directly. We present two proofs of an Ethernet-like contention protocol, one using the interval temporal logic and one using classical temporal logic. We also verify a contention-free protocol using an invariant that seems to have wide applicability for such protocols.