Brunel University Research Archive (BURA) >
University >
Publications >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/6056

Title: An integrated search-based approach for automatic testing from extended finite state machine (EFSM) models
Authors: Kalaji, AS
Hierons, RM
Swift, S
Keywords: Search-based testing
EFSM
Feasible transition paths
Automatic test derivation
Publication Date: 2011
Publisher: Elsevier
Citation: Information and Software Technology, 53: 1297 - 1318, Dec 2011
Abstract: The extended finite state machine (EFSM) is a modelling approach that has been used to represent a wide range of systems. When testing from an EFSM, it is normal to use a test criterion such as transition coverage. Such test criteria are often expressed in terms of transition paths (TPs) through an EFSM. Despite the popularity of EFSMs, testing from an EFSM is difficult for two main reasons: path feasibility and path input sequence generation. The path feasibility problem concerns generating paths that are feasible whereas the path input sequence generation problem is to find an input sequence that can traverse a feasible path. While search-based approaches have been used in test automation, there has been relatively little work that uses them when testing from an EFSM. In this paper, we propose an integrated search-based approach to automate testing from an EFSM. The approach has two phases, the aim of the first phase being to produce a feasible TP (FTP) while the second phase searches for an input sequence to trigger this TP. The first phase uses a Genetic Algorithm whose fitness function is a TP feasibility metric based on dataflow dependence. The second phase uses a Genetic Algorithm whose fitness function is based on a combination of a branch distance function and approach level. Experimental results using five EFSMs found the first phase to be effective in generating FTPs with a success rate of approximately 96.6%. Furthermore, the proposed input sequence generator could trigger all the generated feasible TPs (success rate = 100%). The results derived from the experiment demonstrate that the proposed approach is effective in automating testing from an EFSM.
Description: This is the post-print version of the Article - Copyright @ 2011 Elsevier
URI: http://bura.brunel.ac.uk/handle/2438/6056
DOI: http://dx.doi.org/10.1016/j.infsof.2011.06.004
ISSN: 0950-5849
Appears in Collections:School of Information Systems, Computing and Mathematics Research Papers
Publications
Computer Science

Files in This Item:

File Description SizeFormat
revised_IST3.pdf1.82 MBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.

 


Library (c) Brunel University.    Powered By: DSpace
Send us your
Feedback. Last Updated: September 14, 2010.
Managed by:
Hassan Bhuiyan