Algebraic specification and proof of a distributed recovery algorithm
From MaRDI portal
An algebraic specification is given of an algorithm for recovery from catastrophe by a deterministic process. A second version of the algorithm also includes check-points. The algorithms are formulated in the notations of Communicating Sequential Processes [\textit{C. A. R. Hoare}, Prentice-Hall (Englewood Cliffs 1985)] and the proofs of correctness are conducted wholly by application of algebraic laws (together with the unique fixed point theorem).
Recommendations
Cites work
Cited in
(8)- Design and verification of fault tolerant systems with CSP
- Transformation of programs for fault-tolerance
- A compositional framework for fault tolerance by specification transformation
- A trace-based compositional proof theory for fault tolerant distributed systems
- Modular specification of process algebras
- Lax naturality through enrichment
- A computer checked algebraic verification of a distributed summation algorithm
- Second-level algorithms, superrecursivity, and recovery problem in distributed systems
This page was built for publication: Algebraic specification and proof of a distributed recovery algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090102)