Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Testing Finite-State Machines: State Identification and Verification
IEEE Transactions on Computers
Graph Theory With Applications
Graph Theory With Applications
APSEC '05 Proceedings of the 12th Asia-Pacific Software Engineering Conference
Eliminating redundant tests in a checking sequence
TestCom'05 Proceedings of the 17th IFIP TC6/WG 6.1 international conference on Testing of Communicating Systems
Hi-index | 0.00 |
Conformance testing using test sequences is the main means to ensure that a protocol implementation conforms to its specification. For systems which are specified by nondeterministic finite state machines, a commonly used technique to generate test sequences is the generalized Wp-method with reset which often yields long test sequences if no reliable reset function exists in the system. In this paper, we propose a bipartite graph matching approach to optimize test sequences generated using the generalized Wp-method for protocol conformance testing. Our approach significantly reduces the length of the test sequences required for conformance testing while maintaining the same fault detection capability.