ACM Transactions on Information and System Security (TISSEC)
A Formal Approach for Passive Testing of Protocol Data Portions
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Reliable Hashing without Collosion Detection
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Validation and Test Generation for Object-Oriented Distributed Software
PDSE '98 Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems
Passive testing and applications to network management
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
An Enhanced Passive Testing Tool for Network Protocols
ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
An automata-based approach to property testing in event traces
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
Fast testing of critical properties through passive testing
TestCom'03 Proceedings of the 15th IFIP international conference on Testing of communicating systems
Self-tuned passive testers for grey-box distributed systems with indefinite communication delays
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
| Hi-index | 0.00 |
The generic functionality of passive testing is detecting failures (fault manifestations) in a distributed system. We deal with one of the key functions of a passive tester - Trace Analysis (TA). The standard TA algorithms proceed by traversing a Reference Specification (RS), which is usually given in the form of a FSM automaton. The run-time performance of such algorithms is known to be poor for a large, nondeterministic RS (i.e. for real protocols). To improve this aspect of passive testing, instead of considering new TA algorithms, we try to increase the performance of existing algorithms, by changing the form of a RS to an Event Graph (EG). We define an EG and submit a detailed algorithm for its derivation. We then outline the EG-based algorithm for RS traversal. We report on the results of simulation experiments that clearly show considerable improvements in run-time performance of EG-based passive testing over previous approaches, while the functionality of failure detection is strictly retained.