Transformation of programs for fault-tolerance

DOI10.1007/BF01211393zbMath0754.68084OpenAlexW1996431954WikidataQ60017343 ScholiaQ60017343MaRDI QIDQ1201297

Mathai Joseph, Zhi-Ming Liu

Publication date: 17 January 1993

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01211393

zbMATH Keywords

consistencyfailure semanticsfault- tolerant refinementfault-tolerant transformation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of software (68N99)

Related Items (6)

A case study in the mechanical verification of fault tolerance ⋮ A compositional framework for fault tolerance by specification transformation ⋮ Model-based construction and verification of critical systems using composition and partial refinement ⋮ Unnamed Item ⋮ Failure-divergence semantics and refinement of long running transactions ⋮ Factorizing fault tolerance.

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on atomicity in distributed algorithms
• Stepwise refinement of parallel algorithms
• Proof rules for fault tolerant distributed programs
• Algebraic specification and proof of a distributed recovery algorithm
• A formal model of atomicity in asynchronous systems
• Checkpointing and Rollback-Recovery for Distributed Systems
• An axiomatic basis for computer programming

This page was built for publication: Transformation of programs for fault-tolerance