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}
}
  • Shmuel Katz, Doron A. Peled
  • Published in Distributed Computing 1992
  • Computer Science
  • SummaryWe 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… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 59 CITATIONS

    All from One, One for All: on Model Checking Using Representatives

    VIEW 6 EXCERPTS
    CITES METHODS & BACKGROUND

    Model Checking Conformance with Scenario-Based Specifications

    VIEW 3 EXCERPTS
    CITES METHODS & BACKGROUND

    Application of Partial-Order Methods to Reactive Programs with Event Memorization

    VIEW 5 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Combining partial order reductions with on-the-fly model-checking

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND

    FILTER CITATIONS BY YEAR

    1991
    2017

    CITATION STATISTICS

    • 3 Highly Influenced Citations

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 40 REFERENCES

    Fairness for non-interleaving concurrency

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Interleaving set temporal logic

    VIEW 13 EXCERPTS

    Defining Conditional Independence Using Collapses

    VIEW 1 EXCERPT

    Specifying and proving serializability in temporal logic

    VIEW 1 EXCERPT

    A Stubborn Attack on State Explosion

    VIEW 1 EXCERPT

    Proving partial order liveness properties . 17 th International Colloquium on Automata , Languages and Programming

    • D Peled, A Pnueli
    • Warwick University England July
    • 1990

    Completing the Temporal Picture

    Completing the temporal picture . Proceedings 16 th International Colloquium on Automata , Languages and Programming

    • Z Manna, A Pnueli
    • Lect Notes Comput Sci
    • 1989