A trace-based compositional proof theory for fault tolerant distributed systems

DOI10.1016/0304-3975(94)90167-8zbMath0812.68094OpenAlexW2020263005MaRDI QIDQ1330425

Henk Schepers, J. J. M. Hooman

Publication date: 21 July 1994

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

Full work available at URL: https://research.tue.nl/nl/publications/a-tracebased-compositional-proof-theory-for-fault-tolerant-distributed-systems(7aab7691-a6e6-433e-aa25-e9d4645e2ccd).html

zbMATH Keywords

verificationspecificationfault-tolerant distributed systemstriple- modular redundant system

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items

A trace-based compositional proof theory for fault tolerant distributed systems, Two implementation relations and the correctness of communicating replicated processes, Automating the addition of fault tolerance with discrete controller synthesis

Cites Work

• Specification and compositional verification of real-time systems
• Proof rules for fault tolerant distributed programs
• Algebraic specification and proof of a distributed recovery algorithm
• An incremental specification of the sliding-window protocol
• Design and verification of fault tolerant systems with CSP
• Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
• A trace-based compositional proof theory for fault tolerant distributed systems
• Soundness and Completeness of an Axiom System for Program Verification
• Communicating sequential processes
• Unnamed Item
• Unnamed Item
• Unnamed Item