Algebraic specification and proof of a distributed recovery algorithm
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).
scientific article; zbMATH DE number 4007702