Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/3752
Title: | Generating feasible transition paths for testing from an extended finite state machine (EFSM) with the counter problem |
Authors: | Kalaji, AS Hierons, RM Swift, S |
Keywords: | Search-based testing;Model-based testing;Feasible transition paths;The counter problem;Automatic FTPs generation from EFSMs |
Issue Date: | 2010 |
Publisher: | IEEE |
Citation: | Third IEEE International Conference on Software Testing Verification and Validation Workshops (ICSTW'10), Paris, pp. 232-235, Apr 2010 |
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). |
URI: | http://bura.brunel.ac.uk/handle/2438/3752 |
DOI: | http://doi.ieeecomputersociety.org/10.1109/ICSTW.2010.25 |
Appears in Collections: | Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 317.03 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.