A fast string searching algorithm
Communications of the ACM
A survey of communication protocol testing
Journal of Systems and Software
A Formal Approach for Passive Testing of Protocol Data Portions
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
From Active to Passive: Progress in Testing of Internet Routing Protocols
FORTE '01 Proceedings of the IFIP TC6/WG6.1 - 21st International Conference on Formal Techniques for Networked and Distributed Systems
Passive testing and applications to network management
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Fault Identification in Networks by Passive Testing
SS '01 Proceedings of the 34th Annual Simulation Symposium (SS01)
A passive testing approach based on invariants: application to the WAP
Computer Networks and ISDN Systems
Reference specification issues in on-line verification by passive testing
PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
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
A formal validation methodology for MANET routing protocols based on nodes' self similarity
Computer Communications
Two Complementary Tools for the Formal Testing of Distributed Systems with Time Constraints
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
A passive testing approach based on invariants: application to the WAP
Computer Networks: The International Journal of Computer and Telecommunications Networking
Robustness testing oracle using a sequence alignment algorithm
Proceedings of the First International Workshop on Software Test Output Validation
Measuring test properties coverage for evaluating UML/OCL model-based tests
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Passive testing – a constrained invariant checking approach
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
Data-centric property formulation for passive testing of communication protocols
ACC'11/MMACTEE'11 Proceedings of the 13th IASME/WSEAS international conference on Mathematical Methods and Computational Techniques in Electrical Engineering conference on Applied Computing
Formal passive testing of timed systems: theory and tools
Software Testing, Verification & Reliability
New approach for EFSM-based passive testing of web services
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
Nodes self-similarity to test wireless ad hoc routing protocols
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
An EFSM-based passive fault detection approach
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
A formal data-centric approach for passive testing of communication protocols
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We present a novel methodology to perform passive testing. The usual approach consists in recording the trace produced by the implementation under test and trying to find a fault by comparing this trace with the specification. We propose a more active approach to passive testing where the minimum set of (critical) properties required to a correct implementation may be explicitly indicated. In short, an invariant expresses that each time that the implementation under test performs a given sequence of input/output actions, then it must show a behavior reflected in the invariant. By using an adaptation of the classical pattern matching algorithms on strings, we obtain that the complexity of checking whether an invariant is fulfilled by the observed trace is in O(n ċ m), where n and m are the lengths of the trace and the invariant, respectively. If the length of the invariant is much smaller than the length of the trace then this complexity is almost linear with respect to the length of the trace. Actually, this is usually the case for most practical examples. In addition to our methodology, we present the case study that was the driving force for the development of our theory: The Wireless Application Protocol (WAP). We present a test architecture for WAP as well as the experimental results obtained from the application of our passive testing with invariants approach.