Formal Sequentialization of Distributed Systems via Program Rewriting

DOI10.1016/j.entcs.2007.05.038zbMath1278.68213OpenAlexW1976896488MaRDI QIDQ2867960

August Climent, Francesc Babot, Miquel Bertran

Publication date: 20 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.05.038

zbMATH Keywords

formal verificationrewritingdistributed programsparallel programsformal communication eliminationformal sequentializationlaws of distributed programs

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)

Related Items (1)

Formal communication elimination and sequentialization equivalence proofs for distributed system models

Uses Software

• Polychrony

Cites Work

• Formal communication elimination and sequentialization equivalence proofs for distributed system models
• Decomposition of distributed programs into communication-closed layers
• Static analysis for state-space reductions preserving temporal logics
• The laws of Occam programming
• Partial-order reduction in symbolic state-space exploration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Formal Sequentialization of Distributed Systems via Program Rewriting