An input/output semantics for distributed program equivalence reasoning
From MaRDI portal
Recommendations
- Formal communication elimination and sequentialization equivalence proofs for distributed system models
- Distributed bisimulations
- A compositional proof system for distributed programs
- scientific article; zbMATH DE number 4104372
- Verification of distributed programs using representative interleaving sequences
Cited in
(3)
This page was built for publication: An input/output semantics for distributed program equivalence reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2850665)