Verifying a Sliding Window Protocol using PVS
FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
Modeling and Verification of Biphase Mark Protocolsin Duration Calculus Using PVS
CSD '98 Proceedings of the 1998 International Conference on Application of Concurrency to System Design
Formal specification and verification of a connection establishment protocol
SIGCOMM '81 Proceedings of the seventh symposium on Data communications
Formal Modeling and Analysis of Atomic Commitment Protocols
ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems
Hi-index | 0.98 |
The paper presents a formal modeling and analysis of a protocol for narrow bandwidth channels of service connection establishment and termination. The protocol is characterized by state traces and formally verified by a theorem proving system PVS. Relevant properties are specified and verified in terms of inductive principles. The effectiveness of the proposed method is evidenced by the elaborate analysis which unveils a subtle bug in the initial protocol implementation. The approach is scalable for an arbitrary number of agents.