A search-based approach for automatic test generation from extended finite state machine (EFSM)

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

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	2	en
dc.date.accessioned	2010-01-22T10:42:43Z	-
dc.date.available	2010-01-22T10:42:43Z	-
dc.date.issued	2009	-
dc.identifier.citation	Testing: Academic and Industrial Conference - Practice and Research Techniques (TAIC PART '09), Windsor, pp. 131-132, Sep 2009	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/4059	-
dc.description.abstract	The extended finite state machine is a powerful model that can capture almost all the aspects of a system. However, testing from an EFSM is yet a challenging task due to two main problems: path feasibility and path test data generation. Although optimization algorithms are efficient, their applications to EFSM testing have received very little attention. The aim of this paper is to develop a novel approach that utilizes optimization algorithms to test from EFSM models.	en
dc.language.iso	en	en
dc.publisher	IEEE	en
dc.subject	Evolutionary testing	en
dc.subject	Model-based testing	en
dc.subject	Search-based testing	en
dc.subject	Test data generation	en
dc.subject	Transition path (TP)	en
dc.subject	Extended finite state machine	en
dc.title	A search-based approach for automatic test generation from extended finite state machine (EFSM)	en
dc.type	Conference Paper	en
dc.identifier.doi	http://dx.doi.org/10.1109/TAICPART.2009.19	-
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		219.67 kB	Adobe PDF	View/Open