Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKalaji, AS-
dc.contributor.authorHierons, RM-
dc.contributor.authorSwift, S-
dc.identifier.citation1st International Symposium on Search Based Software Engineering (SSBSE), Windsor, pp. 85-88, May 2009-
dc.identifier.otherDOI: 10.1109/SSBSE.2009.14-
dc.description.abstractSearch based testing approaches are efficient in test data generation; however they are likely to perform poorly when applied to programs with state variables. The problem arises when the target function includes guards that reference some of the program state variables whose values depend on previous function calls. Thus, merely considering the target function to derive test data is not sufficient. This paper introduces a testability transformation approach based on the analysis of control and data flow dependencies to bypass the state variable problem. It achieves this by eliminating state variables from guards and/ or determining which functions to call in order to satisfy guards with state variables. A number of experiments demonstrate the value of the proposed approach.en
dc.format.extent166141 bytes-
dc.subjectTestability transformation (TeTra)en
dc.subjectState variable problemen
dc.subjectState-based programen
dc.subjectSearch-based testing (SBT)en
dc.subjectEvolutionary testing (ET)en
dc.subjectGenetic algorithms (GAs)en
dc.subjectSoftware testingen
dc.subjectAutomatic test data generationen
dc.titleA testability transformation approach for state-based programsen
dc.typeConference Paperen
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
A Testability Transformation Approach for State-Based Programs.pdf528.4 kBAdobe PDFView/Open

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