Formal sequentialization of distributed systems via program rewriting

DOI10.1016/J.ENTCS.2007.05.038MaRDI QIDQ2867960zbMATH OpenOpenAlexFDO

Authors Miquel Bertran, Francesc Babot, August Climent

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

rewritingformal verificationdistributed programsparallel programsformal communication eliminationformal sequentializationlaws of distributed programs

Mathematics Subject Classification ID

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

Recommendations

• Formal communication elimination and sequentialization equivalence proofs for distributed system models
• scientific article; zbMATH DE number 1832216
• On reduction of sequential-parallel compositional programs to entirely sequential form
• Automatic construction of CSP programs from sequential non-deterministic programs
• scientific article; zbMATH DE number 4064498

Cites work

• scientific article; zbMATH DE number 43800 (Why is no real title available?)
• scientific article; zbMATH DE number 52331 (Why is no real title available?)
• scientific article; zbMATH DE number 1487860 (Why is no real title available?)
• scientific article; zbMATH DE number 1746645 (Why is no real title available?)
• scientific article; zbMATH DE number 1832216 (Why is no real title available?)
• An input/output semantics for distributed program equivalence reasoning
• Concurrency verification. Introduction to compositional and noncompositional methods
• Decomposition of distributed programs into communication-closed layers
• Formal communication elimination and sequentialization equivalence proofs for distributed system models
• Partial-order reduction in symbolic state-space exploration
• Static analysis for state-space reductions preserving temporal logics
• The laws of Occam programming
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.

Cited in

(6)

• scientific article; zbMATH DE number 5149070 (Why is no real title available?)
• scientific article; zbMATH DE number 1832216 (Why is no real title available?)
• Formal communication elimination and sequentialization equivalence proofs for distributed system models
• Distributing a class of sequential programs
• Sequentialising nested systems
• On reduction of sequential-parallel compositional programs to entirely sequential form

Describes a project that uses

Uses Software

• Polychrony

This page was built for publication: Formal sequentialization of distributed systems via program rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867960)