By Topic

A Search-Based Approach for Automatic Test Generation from Extended Finite State Machine (EFSM)

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

3 Author(s)
Kalaji, A. ; Sch. of Inf. Syst., Math & Comput., Brunel Univ., Uxbridge, UK ; Hierons, R.M. ; Swift, S.

The extended finite state machine is a powerful model that can capture almost all the aspects of a system. However, testing from an EFSM is yet a challenging task due to two main problems: path feasibility and path test data generation. Although optimization algorithms are efficient, their applications to EFSM testing have received very little attention. The aim of this paper is to develop a novel approach that utilizes optimization algorithms to test from EFSM models.

Published in:

Testing: Academic and Industrial Conference - Practice and Research Techniques, 2009. TAIC PART '09.

Date of Conference:

4-6 Sept. 2009