Sciweavers

GECCO
2008
Springer

Handling dynamic data structures in search based testing

13 years 4 months ago
Handling dynamic data structures in search based testing
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have excelled. This paper introduces a search based testing approach which is able to handle pointers and dynamic data structures. It combines an alternating variable hill climb with a set of constraint solving rules for pointer inputs. The result is a lightweight and efficient method, as shown in the results from a case study, which compares the method to CUTE, a concolic unit testing tool. Categories and Subject Descriptors: D.2.5 [Software Engineering]: Testing and Debugging General Terms: Algorithms, Experimentation, Measurement, Performance.
Kiran Lakhotia, Mark Harman, Phil McMinn
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2008
Where GECCO
Authors Kiran Lakhotia, Mark Harman, Phil McMinn
Comments (0)