Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/3752
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kalaji, AS | - |
dc.contributor.author | Hierons, RM | - |
dc.contributor.author | Swift, S | - |
dc.coverage.spatial | 10 | - |
dc.date.accessioned | 2009-10-23T14:28:58Z | - |
dc.date.available | 2009-10-23T14:28:58Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | Third IEEE International Conference on Software Testing Verification and Validation Workshops (ICSTW'10), Paris, pp. 232-235, Apr 2010 | en |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/3752 | - |
dc.description.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). | en |
dc.language.iso | en_US | en |
dc.publisher | IEEE | en |
dc.subject | Search-based testing | en |
dc.subject | Model-based testing | en |
dc.subject | Feasible transition paths | en |
dc.subject | The counter problem | en |
dc.subject | Automatic FTPs generation from EFSMs | en |
dc.title | Generating feasible transition paths for testing from an extended finite state machine (EFSM) with the counter problem | en |
dc.type | Conference Paper | en |
dc.identifier.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.