Verification of distributed programs using representative interleaving sequences

  title={Verification of distributed programs using representative interleaving sequences},
  author={Shmuel Katz and Doron A. Peled},
  journal={Distributed Computing},
We present a formal proof method for distributed programs. The semantics used to justify the proof method explicitly identifies equivalence classes of execution sequences which are equivalent up to permuting commutative operations. Each equivalence class is called an interleaving set or a run. The proof rules allow concluding the correctness of certain classes of properties for all execution sequences, even though such properties are demonstrated directly only for a subset of the sequences. The… CONTINUE READING
Highly Cited
This paper has 81 citations. REVIEW CITATIONS


Publications citing this paper.

81 Citations

Citations per Year
Semantic Scholar estimates that this publication has 81 citations based on the available data.

See our FAQ for additional information.


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


  • M. Z. Kwiatkowska, Fairness for Non-Interleaving Concurrency, Phd Thesis, Department of Computing Studies
  • May
  • 1989
Highly Influential
3 Excerpts

to appear in TCS-FACS Workshop on Semantics for Concurrency

  • S. Katz, D. Peled, Defining conditional independence using collapses
  • July
  • 1990
1 Excerpt

Designing distributed algorithms by means of formal sequentially phased reasoning , Proceedings of the 3 ra International Workshop on Distributed Algorithms

  • FA Stomp, WP deRoever
  • Lect Notes Comput Sci
  • 1989

Similar Papers

Loading similar papers…