A verified connection management protocol for the transport layer

作者: S. L. Murphy , A. U. Shankar

DOI: 10.1145/55482.55495

关键词:

摘要: We specify and verify a connection management protocol for use between entities connected by channels that can lose, reorder, duplicate messages. The is symmetric. Each entity in one of the following states: closed, listen, open, active opening, passive or closing. first three are stable states to be exited only user request, while last transient states. maintains local incarnation number at all times, remote when Our employs 3-way handshake used TCP ISO Transport Protocol (Class 4).We safety property an its matches entity's number. This ensures data messages from past instances not delivered user. progress properties: actively opening will eventually establish connection, provided willing communicate itself opening; closing transient; if remain become empty, assuming have maximum lifetime.This specification immediately combined with transfer specifications presented [SHAN1, SHAN2, SHAN3] provide transport layer functions two-way transfer. verifications too hierarchical verification multi-function protocol. because protocols images illustrates power projections constructing protocols.

参考文章(12)
Son T. Vuong, Wolfgang Jürgensen, CSP and CSP Nets: A Dual Model for Protocol Specification and Verification. PSTV. pp. 253- 277 ,(1984)
James F. Kurose, The Specification and Verification of a Connection Establishment Protocol Using Temporal Logic Proceedings of the IFIP WG6.1 Second International Workshop on Protocol Specification, Testing and Verification. pp. 43- 62 ,(1982)
A. Udaya Shankar, Simon S. Lam, Time-Dependent Distributed Systems: Proving Safety, Liveness and Real-TimeProperties Distributed Computing. ,vol. 2, pp. 61- 79 ,(1985) , 10.1007/BF01667079
A. Udaya Shankar, Simon S. Lam, A stepwise refinement heuristic for protocol construction ACM Transactions on Programming Languages and Systems. ,vol. 14, pp. 417- 461 ,(1992) , 10.1145/129393.129394
Simon S. Lam, A. Udaya Shankar, Protocol Verification via Projections IEEE Transactions on Software Engineering. ,vol. SE-10, pp. 325- 342 ,(1984) , 10.1109/TSE.1984.5010246
Wolfgang JÜrgensen, Son T. Vuong, Formal specification and validation of ISO transport protocol components, using petri nets acm special interest group on data communication. ,vol. 14, pp. 75- 82 ,(1984) , 10.1145/639624.802063
Carl A. Sunshine, Yogen K. Datal, Connection management in transport protocols Computer Networks. ,vol. 2, pp. 454- 473 ,(1978) , 10.1016/0376-5075(78)90053-3
J. P. Courtiat, J. M. Ayache, B. Algayres, Petri nets are good for protocols acm special interest group on data communication. ,vol. 14, pp. 66- 74 ,(1984) , 10.1145/639624.802062
Edsger Wybe Dijkstra, A Discipline of Programming ,(1976)
A U Shankar, A verified sliding window protocol with variable flow control acm special interest group on data communication. ,vol. 16, pp. 84- 91 ,(1986) , 10.1145/1013812.18183