Sciweavers

Share
ICST
2009
IEEE

Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM)

10 years 11 months ago
Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM)
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the paths. A chosen path may be infeasible and so it is desirable to have methods that can direct the search for appropriate paths through the EFSM towards those that are likely to be feasible. However, generating feasible transition paths (FTPs) for model based testing is a challenging task and is an open research problem. This paper introduces a novel fitness metric that analyzes data flow dependence among the actions and conditions of the transitions of a path in order to estimate its feasibility. The proposed fitness metric is evaluated by being used in a genetic algorithm to guide the search for FTPs.
Abdul Salam Kalaji, Robert M. Hierons, Stephen Swi
Added 24 May 2010
Updated 24 May 2010
Type Conference
Year 2009
Where ICST
Authors Abdul Salam Kalaji, Robert M. Hierons, Stephen Swift
Comments (0)
books