Proceedings of the Fourth Annual Symposium on Logic in computer science
Information Processing Letters
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Fault-containing self-stabilization using priority scheduling
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
A Proof Technique for Rely/Guarantee Properties
Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
An Overview of Formal Verification for the Time-Triggered Architecture
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
A case-study in component-based mechanical verification of fault-tolerant programs
ICDCS '99 Workshop on Self-stabilizing Systems
An exercise in proving convergence through transfer functions
ICDCS '99 Workshop on Self-stabilizing Systems
Detectors and Correctors: A Theory of Fault-Tolerance Components
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Automated Synthesis of Multitolerance
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Breaking up is hard to do: An evaluation of automated assume-guarantee reasoning
ACM Transactions on Software Engineering and Methodology (TOSEM)
Disassembling real-time fault-tolerant programs
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Incremental synthesis of fault-tolerant real-time programs
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
A theory of fault recovery for component-based models
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
A hard-masking real-time program is one that satisfies safety (including timing constraints) and liveness properties in the absence and presence of faults. It has been shown that any hard-masking program can be decomposed into a fault-intolerant version and a set of fault-tolerance components known as detectors and delta-correctors. In this paper, we introduce a set of sufficient conditions for interference-freedom among fault-tolerance components and real-time programs. We demonstrate that such conditions elegantly enable us to compositionally verify the correctness of hard-masking programs. Preliminary model checking experiments show very encouraging results in both achieving speedups and reducing memory usage in verification of embedded systems.