A protocol test generation procedure
Computer Networks and ISDN Systems
Experience with test generation for real protocols
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Towards standardized OSI conformance tests
Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
On Test Sequence Generation for Protocols
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Experience with formal methods in protocol development
ACM SIGCOMM Computer Communication Review
A new protocol conformance test generation method and experimental results
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Optimal length test sequence generation using distinguishing sequences
IEEE/ACM Transactions on Networking (TON)
On testing hierarchies for protocols
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Distinguishing tests for nondeterministic and probabilistic machines
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Efficient computation of unique input/output sequences in finite-state machines
IEEE/ACM Transactions on Networking (TON)
Scientific foundations to the multilevel method
IEEE/ACM Transactions on Networking (TON)
Testing Finite-State Machines: State Identification and Verification
IEEE Transactions on Computers
Midpoints Versus Endpoints: From Protocols to Firewalls
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Context independent unique sequences generation for protocol testing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Using distinguishing and UIO sequences together in a checking sequence
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Timed i/o test sequences for discrete event model verification
AIS'04 Proceedings of the 13th international conference on AI, Simulation, and Planning in High Autonomy Systems
Research: Improving the UIOv-method for protocol conformance testing
Computer Communications
Research: TESTGEN: An environment for protocol test suite generation and selection
Computer Communications
On testing and diagnosis of communication protocols based on the FSM model
Computer Communications
Hi-index | 0.00 |
This paper shows the Unique Input/Output, UIO, approach and the Distinguishing Sequence, DS, approach for the conformance testing of protocol implementations do not always produce identical fault converges, contrary to a previous claim. In the UIO approach, when UIO sequences and signatures are not unique in an implementation, they may not be able to detect erroneous states in the implementation. The UIO approach is revised here with the addition of a verification procedure to ensure that the UIO sequences are all unique in an implementation. Since signatures are generally not unique, this revision requires substituting the use of a signature for a state, S, with a set of input/output sequences, IO(S,K)s, unique to S, each of which distinguishes S from at least one other state, K. Verification is then applied to the IO(S,K)s. Fault coverage in the revised UIO, UIOv, approach is better than that in the original approach. A uniqueness criterion is discussed here to capture a desirable fault coverage for finite-state machine, FSM, test sequences. This criterion ensures the detection of any faulty FSM implementation provided that its set of states does not exceed that in the specified FSM. It is shown that test sequences generated by the UIOv approach and the DS approach always satisfy the uniqueness criterion. In fact, the DS approach is a special case of the UIOv approach; however, the UIOv approach has wider applicability and is generally applicable to k-distinguishable FSMs.