Algebraic specification and proof of a distributed recovery algorithm

DOI10.1007/BF01786251MaRDI QIDQ1090102zbMATH OpenFDO

Authors Jifeng He, Tony Hoare

Publication date 1987

Published in Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

fixed pointCommunicating Sequential Processesdeterministic processproofs of correctness

Mathematics Subject Classification ID

Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 4018375
• scientific article; zbMATH DE number 3872655
• scientific article; zbMATH DE number 3936493
• Algebraic specification of reactive systems
• Much ado about nothing?

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• A Transformation System for Developing Recursive Programs
• Can programming be liberated from the von Neumann style?
• Time, clocks, and the ordering of events in a distributed system

Cited in

(8)

• Modular specification of process algebras
• Design and verification of fault tolerant systems with CSP
• Lax naturality through enrichment
• Second-level algorithms, superrecursivity, and recovery problem in distributed systems
• A computer checked algebraic verification of a distributed summation algorithm
• A compositional framework for fault tolerance by specification transformation
• Transformation of programs for fault-tolerance
• A trace-based compositional proof theory for fault tolerant 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)