A Test Design Methodology for Protocol Testing
IEEE Transactions on Software Engineering
A protocol test generation procedure
Computer Networks and ISDN Systems
Conformance testing: architectures and test sequences
Computer Networks and ISDN Systems
An improved protocol test generation procedure based on UIOS
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Protocol conformance test generation using multiple UIO sequences with overlapping
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Test Selection Based on Finite State Models
IEEE Transactions on Software Engineering
A new protocol test sequence generation method based on UIOS
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Synchronizable test sequences based on multiple UIO sequences
IEEE/ACM Transactions on Networking (TON)
Approaches utilizing segment overlap to minimize test sequences
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
Improvements on UIO Sequence Generation and Partial UIO Sequences
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Conformance Testing of Protocol Machines without Reset
Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
Checking Experiments with Protocol Machines
Proceedings of the IFIP TC6/WG6.1 Fourth International Workshop on Protocol Test Systems IV
Checking Experiments ror Sequential Machines
IEEE Transactions on Computers
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
Switching and Finite Automata Theory
Switching and Finite Automata Theory
| Hi-index | 0.24 |
The UIOv-method for testing the conformance of a protocol implementation to its specification is improved to generate a shorter test sequence. The traditional UIOv-method utilizes minimum-length Unique Input/Output (UIO) sequences to verify the implementation's states, and thus suffers from a long verification part for checking that these UIO sequences are uniquely implemented. The improved method removes this constraint so that each state can select its UIO sequence from a large set of UIO sequences, and thus some choices may shorten the verification. The exclusive tree data structure is also proposed to represent the mutually exclusive relation between UIO sequences (two UIO sequences are called mutually exclusive if no verification is needed within them); each exclusive tree corresponds to a set of UIO sequences. An algorithm is proposed to generate the exclusive tree whose corresponding UIO sequences can be used with the UIOv-method to shorten the verification while not lengthening the total test sequence. Experimentation of two protocol examples and the Q.931 network-side protocol indicate a length reduction for the verification of 100%, 43% and 64%, respectively, and for the total test sequence of 13.8%, 8.6% and 12.7%, respectively.