Verifying Programs That Use Causally-Ordered Message-Passing
| dc.contributor.author | Stoller, Scott D. | en_US |
| dc.contributor.author | Schneider, Fred B. | en_US |
| dc.date.accessioned | 2007-04-23T16:35:39Z | |
| dc.date.available | 2007-04-23T16:35:39Z | |
| dc.date.issued | 1994-05 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 2069002 bytes | |
| dc.format.extent | 430732 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR94-1423 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6205 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Verifying Programs That Use Causally-Ordered Message-Passing | en_US |
| dc.type | technical report | en_US |