By Topic

A bipartite graph approach to generate optimal test sequences for protocol conformance testing using the Wp-method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jun Wang ; Sch. of Comput. Sci. & Comput. Eng., Wenzhou Univ., China ; Jitian Xiao ; Chiou Peng Lam ; Huaizhong Li

Conformance testing using test sequences is used to ensure that a protocol implementation conforms to its specification. A commonly used technique to generate test sequences for specifications described by the finite state machines is the Wp-method with the reset technique, which frequently results in long test sequences. In this paper, we propose a bipartite graph approach to generate optimal test sequences for protocol conformance testing. Our approach significantly reduces the length of the test sequences required for conformance testing while maintaining the same fault detection capability.

Published in:

Software Engineering Conference, 2005. APSEC '05. 12th Asia-Pacific

Date of Conference:

15-17 Dec. 2005