Abstract
A new test sequence generation method is proposed for testing the conformance of a protocol implementation to its data portion modeled by an Extended Finite State Machine which is represented by a Data Flow Digraph. All-Use and IO-df-chain are two important criteria in selecting paths from the Data Flow Digraph in order to generate a test sequence which traces the data flow property, but it is a tedious process to select a path which satisfies the criteria while guaranteeing that the generated test sequence is executable (i.e., one that has feasible parameter values.) The proposed four-step method automatizes the selecting process as well as optimizing the test sequence length. First, the Data Flow Digraph is embedded with certain (but not all) parameter values so as to construct a Behavior Machine Digraph where executable test sequences can be directly generated. Second, executable test paths which trace every association defined by each criterion are generated from the Behavior Machine Digraph. Third, the Behavior Machine Digraph is embedded with these test paths so as to construct the SelectUse and SelectIO Digraphs. Finally, the Selecting Chinese Postman Tours of the two digraphs are used to generate the optimally executable test sequences that satisfy the All-Use and IO-df-chain criteria.
Keywords
This work is supported by the National Science Council of Taiwan under Grant NSC892213E030025 and by Fu Jen University under a grant from the SVD section.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
W. H. Chen, “Test sequence generation from the protocol data portion based on the Selecting Chinese Postman algorithm,” Information Processing Letters, Vol. 65, 1998.
W. H. Chen, “Executable test sequence for the protocol control and data portions,” Proc. of IEEE Int’l Conference on Communications, New Orleans, U. S. A., 2000.
W. H. Chen and H. Ural, “Synchronizable test sequence based on multiple UIO sequences,” IEEE/ACM Trans. on Networking, Vol. 3, No. 2, 1995.
K. T. Cheng and A. S. Krishnakumer, “Automatic functional test generation using the extended finite state machine model,” Proc. IEEE Design Automation Conference, 1993.
R. Dssouli, K. Saleh, E. Aboulhamid, A. En-Nouaary and C. Bourhfir, “Test development for communication protocols: towards automation,” Computer Networks, Vol. 31, 1999.
E. Kwast, “Automatic test generation for protocol data aspects,” Proc. IFIP Int’l Symp. on Protocol Specification, Testing, and Verification, 1992.
J. A. Mchugh, Algorithmic Graph Theory, Prentice-Hall, Englewood Cliffs, NJ, 1990.
L. Schrage, LINDO 5.0 User’s Manual, Scientific Press., 1991.
M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis, Addison-Wesley Publishing Company, 1987.
H. Ural, “Test sequence selection based on static data flow analysis,” Computer Communications, Vol. 10, No. 5, 1987.
H. Ural, K. Saleh and A. Williams, “Test generation based on control and data dependencies within system specification in SDL,” Computer Communications, Vol. 23, 2000.
C. J. Wang and M. T. Liu, “Generating test cases for EFSM with given fault models,” Proc. IEEE INFOCOM, March 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chen, WH.P. (2001). Executable Test Sequence for the Protocol Data Flow Property. In: Kim, M., Chin, B., Kang, S., Lee, D. (eds) Formal Techniques for Networked and Distributed Systems. FORTE 2001. IFIP International Federation for Information Processing, vol 69. Springer, Boston, MA. https://doi.org/10.1007/0-306-47003-9_18
Download citation
DOI: https://doi.org/10.1007/0-306-47003-9_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7470-1
Online ISBN: 978-0-306-47003-5
eBook Packages: Springer Book Archive