A compositional framework for fault tolerance by specification transformation
From MaRDI portal
Publication:1330423
DOI10.1016/0304-3975(94)90166-XzbMath0812.68092MaRDI QIDQ1330423
Publication date: 21 July 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Reliability, testing and fault tolerance of networks and computer systems (68M15) General topics in the theory of software (68N01)
Related Items (3)
A case study in the mechanical verification of fault tolerance ⋮ Unnamed Item ⋮ Encapsulating deontic and branching time specifications
Uses Software
Cites Work
- Verification of multiprocess probabilistic protocols
- Algebraic specification and proof of a distributed recovery algorithm
- Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
- Transformation of programs for fault-tolerance
- Proving and applying program transformations expressed with second-order patterns
- Correctness proofs of distributed termination algorithms
- Checkpointing and Rollback-Recovery for Distributed Systems
- Time, clocks, and the ordering of events in a distributed system
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A compositional framework for fault tolerance by specification transformation