Brunel University Research Archive (BURA) >
Research Areas >
Software Engineering (B-SERC) >

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

Title: A testability transformation approach for state-based programs
Authors: Kalaji, AS
Hierons, RM
Swift, S
Keywords: Testability transformation (TeTra)
State variable problem
State-based program
Search-based testing (SBT)
Evolutionary testing (ET)
Genetic algorithms (GAs)
Software testing
Automatic test data generation
Publication Date: 2009
Publisher: IEEE
Citation: 1st International Symposium on Search Based Software Engineering (SSBSE), Windsor, pp. 85-88, May 2009
Abstract: Search 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.
URI: http://bura.brunel.ac.uk/handle/2438/2974
Appears in Collections:Computer Science
Software Engineering (B-SERC)
Dept of Computer Science Research Papers

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.