Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM) with the Counter Problem

Authors:
Abdul Salam Kalaji;Robert Mark Hierons;Stephen Swift
Affiliations:
-;-;-
Venue:
ICSTW '10 Proceedings of the 2010 Third International Conference on Software Testing, Verification, and Validation Workshops
Year:
2010

Citing 0
Cited 3

A multi-objective evolutionary algorithm to obtain test cases with variable lengths

Proceedings of the 13th annual conference on Genetic and evolutionary computation
An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models

Information and Software Technology
Automatic generation of basis test paths using variable length genetic algorithm

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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).