A fast string searching algorithm
Communications of the ACM
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Comparing the Robustness of POSIX Operating Systems
FTCS '99 Proceedings of the Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing
Passive testing and applications to network management
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Sequence alignment for masquerade detection
Computational Statistics & Data Analysis
ICSTW '08 Proceedings of the 2008 IEEE International Conference on Software Testing Verification and Validation Workshop
A passive testing approach based on invariants: application to the WAP
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast testing of critical properties through passive testing
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
| Hi-index | 0.00 |
In robustness testing, fault injection is a technique commonly used to observe software behavior submitted to stressful conditions. To check if the software reacts as expected we must use an oracle, a reference for correct system behavior. Typically, in fault injection based approaches, the oracle just verifies the result against a previous execution, without the injection of faults (golden run). This oracle may not be reliable, since the original run may contain undetected errors. This paper proposes an approach for evaluation results of robustness testing. The approach is based on passive testing technique, in which the system execution is monitored to collect an execution trace; then the trace is analyzed to determine whether it satisfies desired properties or not. This analysis can be performed using pattern matching algorithms, where the pattern, represented by the desired property, is matched against the execution trace. In the proposed approach the pattern matching algorithm commonly used for pairwise alignment of biological sequences was adapted to process robustness testing results. We chose local alignment technique and predefined scoring function to implement the alignment between the trace and desired behavior. The adaptation of sequence alignment algorithms in this different context is promising. We present the results of experiments performed using different scoring functions.