This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2010 Third International Conference on Software Testing, Verification, and Validation Workshops
Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM) with the Counter Problem
Paris, France
April 06-April 10
ISBN: 978-0-7695-4050-4
The extended finite state machine (EFSM) is a powerful approach for modeling state-based systems. However, testing from EFSMs is complicated by the existence of infeasible paths. One important problem is the existence of a transition with a guard that references a counter variable whose value depends on previous transitions. The presence of such transitions in paths often leads to infeasible paths. This paper proposes a novel approach to bypass the counter problem. The proposed approach is evaluated by being used in a genetic algorithm to guide the search for feasible transition paths (FTPs).
Index Terms:
Search-Based Software Testing, Testing from Extended Finite State Machine (EFSM), Generating Feasible Transition Paths (FTPs), the Counter Problem
Citation:
Abdul Salam Kalaji, Robert Mark Hierons, Stephen Swift, "Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM) with the Counter Problem," icstw, pp.232-235, 2010 Third International Conference on Software Testing, Verification, and Validation Workshops, 2010
Usage of this product signifies your acceptance of the Terms of Use.