Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10]


Journal of Information Science and Engineering, Vol. 21 No. 3, pp. 529-545 (May 2005)

Executable Test Sequence for the Protocol Data
Portion Based on Two Criteria*

Wen-Huei Chen
Department of Electronic Engineering
Fu Jen Catholic Unviersity
Hsinchuang, 242 Taiwan

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 (EFSM), which is represented by a Data Flow Digraph. All-Use and IO-df- chain are two important criteria for selecting paths from the Data Flow Digraph 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). In this paper, we propose a four-step method for generating the executable test sequence. The first step is a manual process, while the other three steps involves automatic as well as optimizing algorithms. The first step involves the manual generation of a Behavior Machine Digraph from the Data Flow Digraph by embedding certain (but not all) parameter values so that every path of the new digraph is executable. Unlike the FSM for circuits, the size of the Data Flow Digraphs for real protocols can be managed test experts. In the second step, executable test paths which trace every association defined by each criterion are generated from the Behavior Machine Digraph. In the third step, 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 executable test sequences that satisfy the All-Use and IO-df-chain criteria.

Keywords: conformance testing, executable test sequence, data flow, protocol, Chinese Postman tour

Full Text (¥þ¤åÀÉ) Retrieve PDF document (200505_03.pdf)

Received November 7, 2003; revised April 14 & May 25, 2004; accepted July 8, 2004.
Communicated by Chu-Sing Yang.
* This work was supported by the National Science Council of Taiwan under Grant NSC892213E030025 and by Fu Jen Catholic University under a grant from the SVD section. Part of this paper appeared as ¡§Executable test sequence for the protocol data flow property¡¨ in IFIP 21st International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), 2001.