Abstract
Protocol conformance testing aims at checking if a protocol implementation conforms to the standard (or specification) it is supposed to support. The results of testing can be classified into global verdict showing the tested system is either error-free or faulty, and local verdict indicating whether each element (e.g., a transition in the FSM) of the system is implemented correctly or not. In reality, the conventional protocol test procedure may give wrong local verdicts in the initial stages of testing because the procedure uses predetermined test sequence. In this paper, we propose a dynamic procedure for protocol testing using Test Sequence Tree (TST). The procedure allows us to get local verdicts more correctly than the conventional methods. The TST is reconfigured dynamically to obtain accurate verdicts for the untested elements by feedback of the local verdicts of the tested elements. The proposed technique was tested on the ITU-T Q.2931 signalling protocol. Our results showed that the fault coverage of our test procedure is better than the conventional methods. An extension of the proposed dynamic testing technique to the nondeterministic FSM is also discussed.
Chapter PDF
References
S. Naito and M. Tsuoyama (1981), “Fault detection for sequential machines by transition tours”, IEEE 11`h Fault Tolerant Comp. Symp., 238–43.
G. Gonenc (1970), “A method for the design of fault detection experiments”, IEEE Trans. on Computer., vol C-19, pp. 551–558.
Krishan Sabnani and Anton Dahbura (1988), “A Protocol Test Generation Procedure”, Computer Networks and ISDN Systems, vol. 15, 285–97.
Tsun S. Chow (1978), “Testing Software Design Modeled by Finite-State Machines”, IEEE Trans. on Software Eng., vol. SE-4, no. 3, 178–87.
Deepinder P. Sidhu and Ting-kau Leung (1989), “Formal Methods for Protocol Testing: A Detailed Study”, IEEE Trans. on Software Eng., vol. 15, no. 4, 413–26.
Myungchul Kim, S.T. Chanson, and Sangjo Yoo (1995), “Design for testability for protocols based on formal specifications”, The 8`h Int’l Workshop on Protocol Test Systems, 257–69.
M. U. Uyar and A. T. Dahbura (1986), “Optimal Test Sequence Generation for Protocols: The Chinese Postman Algorithm Applied to Q.931”, IEEE Global Telecom. Conf.
Alfred V. Aho, Anton T. Dahbura, David Lee, and M. Umit Uyar (1988), “An Optimization Technique for Protocol Conformance Test Generation Based on UIO Sequences and Rural Chinese Postman Tours”, Protocol Specification, Verification, and Testing, V III, 75–86.
Shen, Y.-N., F. Lombardi, and A. T. Dahura (1989), “Protocol Conformance
Testing Using Multiple UIO Sequences“, Protocol Specification, Verification, and Testing, IX, 131–43.
Mon-Song Chen, Yanghee Choi, and Aaron Kershenbaum (1990), “Approaches Utilizing Segment Overlap to Minimize Test Sequences”,Protocol Specification,Verification,and Testing, IX,85–98.
S. T. Chanson and Qin Li (1992), “On Static and Dynamic Test Case Selections in Protocol Conformance Testing”, The 5th Int’l Workshop on Protocol Test Systems, 225–67
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Yoo, S., Kim, M., Kang, D. (1997). An approach to dynamic protocol testing. In: Kim, M., Kang, S., Hong, K. (eds) Testing of Communicating Systems. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35198-8_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-35198-8_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6701-8
Online ISBN: 978-0-387-35198-8
eBook Packages: Springer Book Archive