{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:13:24Z","timestamp":1725473604320},"reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0084800","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T13:12:14Z","timestamp":1164373934000},"page":"317-324","source":"Crossref","is-referenced-by-count":0,"title":["At-most-once message delivery A case study in algorithm verification"],"prefix":"10.1007","author":[{"given":"Butler","family":"Lampson","sequence":"first","affiliation":[]},{"given":"Nancy","family":"Lynch","sequence":"additional","affiliation":[]},{"given":"J\u00f8rgen","family":"S\u00f8gaard-Andersen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and L. Lamport. The existence of refinement mappings. In Proceedings of the 3rd Annual Symposium on Logic in Computer, pages 165\u2013175, Edinburgh, Scotland, July 1988.","DOI":"10.1109\/LICS.1988.5115"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"D. Belsnes. Single message communication. IEEE Transactions on Communications, Com-24(2), February 1976.","DOI":"10.1109\/TCOM.1976.1093283"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"B. Liskov, L. Shrira, and J. Wroclawski. Efficient at-most-once messages based on synchronized clocks. Technical Report MIT\/LCS\/TR-476, Laboratory for Computer Science, Massachusetts Institute of Technology, April 1990.","DOI":"10.1145\/99508.99530"},{"key":"23_CR4","unstructured":"N. Lynch and I. Saias. Distributed Algorithms. Fall 1990 Lecture Notes for 6.852. MIT\/LCS\/RSS 16, Massachusetts Institute of Technology, February 1992."},{"key":"23_CR5","volume-title":"Techical Report MIT\/LCS\/TR-387","author":"N. Lynch","year":"1987","unstructured":"N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. Techical Report MIT\/LCS\/TR-387, Laboratory for Computer Science, Massachusetts Institute Technology, Cambridge, MA, 02139, April 1987."},{"issue":"3","key":"23_CR6","first-page":"219","volume":"2","author":"N. Lynch","year":"1989","unstructured":"N. Lynch and M. Tuttle. An introduction to Input\/Output automata. CWI-Quarterly, 2(3):219\u2013246, September 1989.","journal-title":"CWI-Quarterly"},{"key":"23_CR7","volume-title":"LNCS 600","author":"N. Lynch","year":"1992","unstructured":"N. Lynch and F. Vaandrager. Forward and backward simulations for timing-based systems. In Proceedings of REX Workshop \u201cReal-Time: Theory in Practice\u201d, Mook, The Netherland, 1992. Springer-Verlag, LNCS 600."},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"F. Modugno, M. Merritt, and M. Tuttle. Time constrained automata. In CONCUR'91 Proceedings Workshop on Theories of Concurrency: Unification and Extension, Amsterdam, August 1991.","DOI":"10.1007\/3-540-54430-5_103"},{"issue":"4","key":"23_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6(4):319\u2013340, 1976.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084800.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:07:27Z","timestamp":1607551647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540558224"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0084800","relation":{},"subject":[]}}