Formal communication elimination and sequentialization equivalence proofs for distributed system models
From MaRDI portal
Publication:466919
DOI10.1007/S00236-014-0203-0zbMATH Open1360.68471OpenAlexW1965122436MaRDI QIDQ466919FDOQ466919
Authors: Miquel Bertran, Francesc Babot, August Climent 
Publication date: 31 October 2014
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-014-0203-0
Recommendations
- Formal sequentialization of distributed systems via program rewriting
- An input/output semantics for distributed program equivalence reasoning
- scientific article; zbMATH DE number 1832216
- Verification of distributed programs using representative interleaving sequences
- scientific article; zbMATH DE number 1059321
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)
Cites Work
- Process algebra for synchronous communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Refinement Calculus
- Data Refinement
- Title not available (Why is that?)
- Algebra of communicating processes with abstraction
- A calculus of communicating systems
- Proof of correctness of data representations
- Concurrency verification. Introduction to compositional and noncompositional methods
- Temporal verification of reactive systems: response
- Title not available (Why is that?)
- Title not available (Why is that?)
- Prespecification in data refinement
- Decomposition of distributed programs into communication-closed layers
- Distributed cooperation with action systems
- Title not available (Why is that?)
- Refinement of fair action systems
- Static analysis for state-space reductions preserving temporal logics
- The laws of Occam programming
- An input/output semantics for distributed program equivalence reasoning
- Formal sequentialization of distributed systems via program rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partial-order reduction in symbolic state-space exploration
- Consolidated Ada reference manual. Language and standard libraries. International standard ISO/ IEC 8652/1995(E) with technical corrigendum 1
Cited In (3)
Uses Software
This page was built for publication: Formal communication elimination and sequentialization equivalence proofs for distributed system models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466919)
