JavaScript is disabled for your browser. Some features of this site may not work without it.
Verifying Programs That Use Causally-Ordered Message-Passing

Author
Stoller, Scott D.; Schneider, Fred B.
Abstract
We 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.
Date Issued
1994-05Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR94-1423
Type
technical report