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

Abdul Salam Kalaji; Robert Mark Hierons; Stephen Swift

doi:10.1109/ICST.2009.29

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

Abdul Salam Kalaji, Robert Mark Hierons, Stephen Swift

Computer And Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution book

92 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	2009 International Conference on Software Testing Verification and Validation
Pages	230-239
Number of pages	10
ISBN (Electronic)	978-0-7695-3601-9
DOIs	https://doi.org/10.1109/ICST.2009.29
Publication status	Published - 17 Apr 2009
Event	2009 International Conference on Software Testing Verification and Validation - Denver, United States Duration: 1 Apr 2009 → 4 Apr 2009

Conference

Conference	2009 International Conference on Software Testing Verification and Validation
Country/Territory	United States
City	Denver
Period	1/04/09 → 4/04/09

Keywords

Automata
Software testing
System testing
Automatic testing
Information systems
Data analysis
Genetic algorithms
Control system synthesis
Automatic control
Hardware

Access to Document

10.1109/ICST.2009.29

Cite this

@inproceedings{b2a5f41ed64c42268ebe674c27ad7e95,

title = "Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM)",

abstract = "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.",

keywords = "Automata, Software testing, System testing, Automatic testing, Information systems, Data analysis, Genetic algorithms, Control system synthesis, Automatic control, Hardware",

author = "Kalaji, {Abdul Salam} and Hierons, {Robert Mark} and Stephen Swift",

year = "2009",

month = apr,

day = "17",

doi = "10.1109/ICST.2009.29",

language = "English",

isbn = "978-1-4244-3775-7",

pages = "230--239",

booktitle = "2009 International Conference on Software Testing Verification and Validation",

note = "2009 International Conference on Software Testing Verification and Validation ; Conference date: 01-04-2009 Through 04-04-2009",

}

Kalaji, AS, Hierons, RM & Swift, S 2009, Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM). in 2009 International Conference on Software Testing Verification and Validation., 4815355, pp. 230-239, 2009 International Conference on Software Testing Verification and Validation, Denver, Colorado, United States, 1/04/09. https://doi.org/10.1109/ICST.2009.29

TY - GEN

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

AU - Kalaji, Abdul Salam

AU - Hierons, Robert Mark

AU - Swift, Stephen

PY - 2009/4/17

Y1 - 2009/4/17

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

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

KW - Automata

KW - Software testing

KW - System testing

KW - Automatic testing

KW - Information systems

KW - Data analysis

KW - Genetic algorithms

KW - Control system synthesis

KW - Automatic control

KW - Hardware

UR - https://ieeexplore.ieee.org/document/4815355/

U2 - 10.1109/ICST.2009.29

DO - 10.1109/ICST.2009.29

M3 - Conference contribution book

SN - 978-1-4244-3775-7

SP - 230

EP - 239

BT - 2009 International Conference on Software Testing Verification and Validation

T2 - 2009 International Conference on Software Testing Verification and Validation

Y2 - 1 April 2009 through 4 April 2009

ER -

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

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this