A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verifying concurrent processes using temporal logic
Verifying concurrent processes using temporal logic
A unified approach to formal verification of network safety properties
A unified approach to formal verification of network safety properties
Using message passing for distributed programming: proof rules and disciplines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Correctness Proofs of Communicating Processes: Three Illustrative Examples From the Literature
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving liveness for networks of communicating finite state machines
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Modular verification of asynchronous networks
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
IEEE Transactions on Computers
Verifying temporal properties without temporal logic
ACM Transactions on Programming Languages and Systems (TOPLAS)
A fully abstract trace model for dataflow networks
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A discipline for constructing multiphase communication protocols
ACM Transactions on Computer Systems (TOCS)
A model and temporal proof system for networks of processes
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Concepts and Notations for Concurrent Programming
ACM Computing Surveys (CSUR)
The Need for Compositional Proof Systems: A Survey
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
An exercise in constructing multi-phase communication protocols
SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
Real-time programming and asynchronous message passing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A technique for proving liveness of communicating finite state machines with examples
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Now you may compose temporal logic specifications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Proving safety properties for a general communication protocol
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
P-A logic: a compositional proof system for distributed programs
Distributed Computing
Stenning's protocol implemented in UDP and verified in Isabelle
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
| Hi-index | 0.00 |
A method is proposed for reasoning about safety and liveness properties of message passing networks. The method is hierarchical and is based upon combining the specifications of component processes to obtain the specification of a network. The inference rules for safety properties use induction on the number of messages transmitted; liveness proofs use techniques similar to termination proofs in sequential programs. We illustrate the method with two examples: concatenations of buffers to construct larger buffers and a special case of Stenning protocol for message communication over noisy channels.