Algebraic specification and proof of a distributed recovery algorithm (Q1090102)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1090102 |
scientific article; zbMATH DE number 4007702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algebraic specification and proof of a distributed recovery algorithm |
scientific article; zbMATH DE number 4007702 |
Statements
Algebraic specification and proof of a distributed recovery algorithm (English)
0 references
1987
0 references
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).
0 references
deterministic process
0 references
Communicating Sequential Processes
0 references
proofs of correctness
0 references
fixed point
0 references
0.7274308204650879
0 references
0.7271883487701416
0 references
