Factorizing fault tolerance.

DOI10.1016/S0304-3975(01)00202-XMaRDI QIDQ1853629zbMATH OpenOpenAlexFDO

Authors I. S. W. B. Prasetya, S. Doaitse Swierstra

Publication date 21 January 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(01)00202-x

zbMATH Keywords

Formal methodsFault toleranceCompositionality

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• A trace-based compositional proof theory for fault tolerant distributed systems
• Logical specification and analysis of fault tolerant systems through partial model checking
• A compositional specification theory for component behaviours
• Foundations of Software Science and Computation Structures
• scientific article; zbMATH DE number 3890717

Cites work

• scientific article; zbMATH DE number 512850 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• An assertional correctness proof of a distributed algorithm
• Composition of assumption-commitment specifications in a UNITY style
• Self-stabilizing systems in spite of distributed control
• Transformation of programs for fault-tolerance

Cited in

(4)

• Formalization of an architectural model for exception handling coordination based on CA action concepts
• scientific article; zbMATH DE number 5182532 (Why is no real title available?)
• A closer look at fault tolerance
• A closer look at fault tolerance

Describes a project that uses

Uses Software

• UNITY

This page was built for publication: Factorizing fault tolerance.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853629)