Formal communication elimination and sequentialization equivalence proofs for distributed system models

DOI10.1007/S00236-014-0203-0zbMath1360.68471OpenAlexW1965122436MaRDI QIDQ466919

Francesc Babot, Miquel Bertran, 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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14)

Related Items (1)

Formal Sequentialization of Distributed Systems via Program Rewriting

Uses Software

• Ada95
• PVS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Prespecification in data refinement
• Decomposition of distributed programs into communication-closed layers
• Algebra of communicating processes with abstraction
• A calculus of communicating systems
• Refinement of fair action systems
• Static analysis for state-space reductions preserving temporal logics
• Proof of correctness of data representations
• The laws of Occam programming
• Formal Sequentialization of Distributed Systems via Program Rewriting
• Temporal Verification of Reactive Systems: Response
• Process algebra for synchronous communication
• Distributed cooperation with action systems
• Refinement Calculus
• Data Refinement
• 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

This page was built for publication: Formal communication elimination and sequentialization equivalence proofs for distributed system models