Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A compositional approach to superimposition
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Relational Notation for State Transition Systems
IEEE Transactions on Software Engineering
A discipline for constructing multiphase communication protocols
ACM Transactions on Computer Systems (TOCS)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Communicating sequential processes
Communications of the ACM
An Improved Method for Constructing Multiphase Communications Protocols
IEEE Transactions on Computers
Proceedings of the 3rd International Workshop on Distributed Algorithms
A decomposition method for the analysis and design of finite state protocols
SIGCOMM '83 Proceedings of the eighth symposium on Data communications
Modular Object-Oriented Design of Distributed Protocols
TOOLS '00 Proceedings of the Technology of Object-Oriented Languages and Systems (TOOLS 34'00)
Verifying liveness properties of multifunction composite protocols
Computer Communications
Hi-index | 0.00 |
The complexity of designing protocols has led to compositional techniques for designing and verifying protocols. We propose a technique based on the notion of parallel composition of protocols. We view a composite protocol as an interleaved execution of the component protocols subject to a set of constraints. Using the constraints as building blocks, we define several constraint-based structures with each structure combining the properties of the component protocols in a different way. For instance, the component protocols of a multifunction protocol can be structured so that the composite protocol performs all the individual functions concurrently or performs only one of them depending on the order of initiation of the component protocols. We provide inference rules to infer safety and liveness properties of the composite protocol. Some properties are derived from those of the component protocols while others are derived from the structuring mechanism (the set of constraints) used to combine the component protocols.