Structural analysis of protocol specifications and generation of maximal fault coverage conformance test sequences

A theoretical analysis of the fault coverage of conformance test sequences for communication protocols specified as finite state machines is presented. Faults of different types are considered, and their effect on testing is analyzed. The interaction between faults of different categories and the impact it has on conformance testing is investigated. Fault coverage is defined for the testing of both incompletely-specified machines (ISMs) and completely-specified machines (CSMs). An algorithm is presented to generate test sequences with maximal fault coverage for the testing of ISMs. It is then augmented for the testing of CSMs, and finally a technique is presented for generating test sequences which provides guaranteed maximal fault coverage for the conformance testing of communication protocols. >

[1]  Sanjoy Paul,et al.  On the generation of minimal-length conformance tests for communication protocols , 1993, TNET.

[2]  Fabrizio Lombardi,et al.  Protocol Conformance Testing by Discriminating UIO Sequences , 1991, PSTV.

[3]  Deepinder P. Sidhu,et al.  On sufficient conditions for an efficient protocol conformance test generation technique based on rural Chinese postman problem , 1991 .

[4]  Yanghee Choi,et al.  Approaches utilizing segment overlap to minimize test sequences , 1990, PSTV.

[5]  Deepinder P. Sidhu,et al.  On arbitrariness in protocol conformance test generation , 1990 .

[6]  Alfred V. Aho,et al.  An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours , 1991, IEEE Trans. Commun..

[7]  Gregor von Bochmann,et al.  Some Experience with Test Sequence Generation for Protocols , 1982, PSTV.

[8]  Fabrizio Lombardi,et al.  Protocol conformance testing using multiple UIO sequences , 1989, IEEE Trans. Commun..

[9]  Deepinder Sidhu,et al.  Fault coverage of protocol test methods , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[10]  Tsun S. Chow,et al.  Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.

[11]  W. Y. L. Chan,et al.  An improved protocol test generation procedure based on UIOS , 1989, SIGCOMM 1989.

[12]  Krishan K. Sabnani,et al.  A Protocol Test Generation Procedure , 1988, Comput. Networks.

[13]  Deepinder P. Sidhu,et al.  Fault coverage of probabilistic test sequences , 1990 .

[14]  Sanjoy Paul.  A structural analysis approach for designing efficient and effective algorithms for conformance testing of communication protocols , 1992 .

[15]  Sanjoy Paul,et al.  Generating minimal length test sequences for conformance testing of communication protocols , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[16]  Güney Gönenç,et al.  A Method for the Design of Fault Detection Experiments , 1970 .

[17]  Deepinder P. Sidhu,et al.  A formal description technique for protocol engineering , 1990 .

[18]  H. Ural,et al.  Protocol conformance test generation using multiple UIO sequences with overlapping , 1990, SIGCOMM 1990.

[19]  Chao Feng.  On the detectability of test sequences for protocol verification and validation , 1992 .

[20]  Fabrizio Lombardi,et al.  Evaluation and improvement of fault coverage of conformance testing by UIO sequences , 1992, IEEE Trans. Commun..

[21]  Edward A. Feigenbaum,et al.  Switching and Finite Automata Theory: Computer Science Series , 1990 .

[22]  Sanjoy Paul,et al.  Generating maximal fault coverage conformance test sequences of reduced length for communication protocols , 1993, 1993 International Conference on Network Protocols.

[23]  Deepinder P. Sidhu,et al.  Undetected faults in protocol testing , 1995, IEEE Trans. Commun..