{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:54Z","timestamp":1750308234302,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[1985,1]]},"abstract":"<jats:p>An important issue in computer network design is end-to-end control, a term covering error control and flow control. The validity of schemes for these purposes may be demonstrated using simple formal models, in which assertions about central program variables are proven. S. Krogdahl [2] and D. E. Knuth [1] have shown the validity of error control for a class of data link protocols using such methods. In this paper their method is extended to cover flow control. The method is illustrated by proving assertions for a simple case, and it is shown how complex systems may be seen as compositions of the simple case.<\/jats:p>","DOI":"10.1145\/1040124.1040125","type":"journal-article","created":{"date-parts":[[2005,1,26]],"date-time":"2005-01-26T16:49:14Z","timestamp":1106758154000},"page":"9-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Verification of flow control protocols"],"prefix":"10.1145","volume":"15","author":[{"given":"Klaus","family":"Hansen","sequence":"first","affiliation":[{"name":"University of Copenhagen, Sigurdsgade, Copenhagen N"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1985,1]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934068"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932022"},{"key":"e_1_2_1_3_1","unstructured":"ISO\/IS 7498 Open Systems Interconnection (1983)  ISO\/IS 7498 Open Systems Interconnection (1983)"},{"key":"e_1_2_1_4_1","unstructured":"C. A. Sunshine: Formal Modelling of Communication Protocols. USC\/Information Sciences Institute RR-81-89 (March 1981)  C. A. Sunshine: Formal Modelling of Communication Protocols. USC\/Information Sciences Institute RR-81-89 (March 1981)"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1040124.1040125","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1040124.1040125","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:45Z","timestamp":1750264305000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1040124.1040125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["10.1145\/1040124.1040125"],"URL":"https:\/\/doi.org\/10.1145\/1040124.1040125","relation":{},"ISSN":["0146-4833"],"issn-type":[{"type":"print","value":"0146-4833"}],"subject":[],"published":{"date-parts":[[1985,1]]},"assertion":[{"value":"1985-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}