Stoller, Scott D.Schneider, Fred B.2007-04-232007-04-231994-05http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR94-1423https://hdl.handle.net/1813/6205We give an operational model of causally-ordered message-passing primitives. Based on this model, we formulate a Hoare-style proof system for causally-ordered delivery. To illustrate the use of this proof system and to demonstrate the feasibility of applying invariant-based verification techniques to algorithms that depend on causally-ordered delivery, we verify an asynchronous variant of the distributed termination detection algorithm of Dijkstra, Feijen, and van Gasteren.2069002 bytes430732 bytesapplication/pdfapplication/postscripten-UScomputer sciencetechnical reportVerifying Programs That Use Causally-Ordered Message-Passingtechnical report