Tentative steps toward a development method for interfering programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fault detection with multiple observers
IEEE/ACM Transactions on Networking (TON)
Observer-A Concept for Formal On-Line Validation of Distributed Systems
IEEE Transactions on Software Engineering
Software reliability via run-time result-checking
Journal of the ACM (JACM)
Dependability: Basic Concepts and Terminology
Dependability: Basic Concepts and Terminology
Assume-Guarantee Model Checking of Software: A Comparative Case Study
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Lazy Compositional Verification
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
The Need for Compositional Proof Systems: A Survey
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
How Did Software Get So Reliable Without Proof?
FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
A GSM-MAP Protocol Experiment Using Passive Testing
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Passive testing and applications to network management
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Automatic failure detection with Conditional-Belief supervisors
ISSRE '96 Proceedings of the The Seventh International Symposium on Software Reliability Engineering
IEEE Transactions on Software Engineering
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Towards automatic monitoring of component-based software systems
Journal of Systems and Software - Special issue: Automated component-based software engineering
| Hi-index | 0.00 |
This paper presents an approach based on assume-guarantee style reasoning for automatic detection of software failures. Reasoning about failures requires knowing the expected behavior. The paper considers the case when the requirement specification of the behavior of the target system is available, and expressed in a formalism based on communicating finite state machines. The failure detector observes the external inputs and outputs, and receives partial information about the internal state of the target system. Using this information, it interprets the specification, and determines whether a failure has occurred. A key issue in the interpretation of the specification is the efficiency of handling of inherent nondeterminism present in the specification. The paper describes, in a step by step manner, a compositional approach for online failure detection which reduces the computational costs of dealing with non-determinism. The details of the algorithms required in each of the steps are provided. To evaluate the algorithms described, a prototype failure detector was used to detect failures of the control program of a small telephone exchange. We present some of the results obtained.