Using message passing for distributed programming: proof rules and disciplines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Analysis of the resequencing delay for M/M/m systems
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Control predicates are better than dummy variables for reasoning about program control
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Mean Resequencing Delay for M/H/sub K// Infinity Systems
IEEE Transactions on Software Engineering
Flush primitives for asynchronous distributed systems
Information Processing Letters
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
Partial-order transport service for multimedia and other applications
IEEE/ACM Transactions on Networking (TON)
Addendum to "Proof Rules for Flush Channels"
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
Flush channels generalize conventional asynchronous communication constructs such as virtual circuits and datagrams. They permit the programmer to specify receipt-order restrictions on a message-by-message basis, providing an opportunity for more concurrency in a distributed program. A Hoare-style partial correctness verification methodology for distributed systems which use flush channel communication is developed, and it is shown that it it possible to reason about such systems in a relatively natural way.