Highly Influenced

# Verification of distributed programs using representative interleaving sequences

@article{Katz1992VerificationOD, title={Verification of distributed programs using representative interleaving sequences}, author={Shmuel Katz and Doron A. Peled}, journal={Distributed Computing}, year={1992}, volume={6}, pages={107-120} }

- Published 1992 in Distributed Computing
DOI:10.1007/BF02252682

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

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 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.