## Abstract

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 subset used must include a representative sequence from each interleaving set, and the proof rules, when applicable, guarantee that this is the case. By choosing a subset with appropriate sequences, simpler intermediate assertions can be used than in previous formal approaches. The method employs proof lattices, and is expressed using the temporal logic ISTL.

Original language | English |
---|---|

Pages (from-to) | 107-120 |

Number of pages | 14 |

Journal | Distributed Computing |

Volume | 6 |

Issue number | 2 |

DOIs | |

State | Published - Sep 1992 |

Externally published | Yes |

## Keywords

- Communication-closed layers
- Distributed programs
- Eventuality properties
- Interleaving sets
- Partial order semantics
- Proof lattices
- Representative sequences
- Verification