Verifying Programs That Use Causally-Ordered Message-Passing

@article{Stoller1995VerifyingPT,
  title={Verifying Programs That Use Causally-Ordered Message-Passing},
  author={Scott D. Stoller and Fred B. Schneider},
  journal={Sci. Comput. Program.},
  year={1995},
  volume={24},
  pages={105-128}
}
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. ∗This author is… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
7 Extracted Citations
22 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 22 references

Synchronous and asynchronous communication in distributed computations

  • Bernadette Charron-Bost, Friedemann Mattern, Gerard Tel
  • Technical Report LITP 9277, Institut Blaise…
  • 1992

Similar Papers

Loading similar papers…