Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Algebraic specification and proof of a distributed recovery algorithm

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 (Hoare 1985) and the proofs of correctness are conducted wholly by application of algebraic laws (together with the unique fixed point theorem). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Distributed Computing Springer Journals

Algebraic specification and proof of a distributed recovery algorithm

Distributed Computing , Volume 2 (1) – May 12, 2005

Loading next page...
 
/lp/springer-journals/algebraic-specification-and-proof-of-a-distributed-recovery-algorithm-ERoK5XGk7g

References (10)

Publisher
Springer Journals
Copyright
Copyright © 1987 by Springer-Verlag
Subject
Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
ISSN
0178-2770
eISSN
1432-0452
DOI
10.1007/BF01786251
Publisher site
See Article on Publisher Site

Abstract

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 (Hoare 1985) and the proofs of correctness are conducted wholly by application of algebraic laws (together with the unique fixed point theorem).

Journal

Distributed ComputingSpringer Journals

Published: May 12, 2005

There are no references for this article.