By Topic

A unified approach to protocol test sequence generation

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
$33 $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

2 Author(s)
S. T. Chanson ; Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada ; J. Zhu

The authors present an approach that combines control flow and data flow analysis techniques to generate unified test sequences (UTSs) for testing protocols modeled as an extended finite-state machine (EFSM). The UTS has the same fault detection capability as the characterizing sequence (UIO, DS, or W) methods for the control part, and at the same time covers all paths that connect variable definitions and uses (all du-paths) for data flow testing. A transition dependence graph is proposed to represent the dependence relations between transitions needed to construct the test sequences. The executable UTS is then selected using constraint satisfaction problem (CSP) solution techniques and transition loop analysis

Published in:

INFOCOM '93. Proceedings.Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, IEEE

Date of Conference:

1993