Handling Dynamic Data Structures in Search-Based Testing

by Kiran Lakhotia, Mark Harman and Phil McMinn

Genetic and Evolutionary Computation Conference (GECCO 2008)



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.


Reference

Kiran Lakhotia, Mark Harman and Phil McMinn. Handling Dynamic Data Structures in Search-Based Testing. Genetic and Evolutionary Computation Conference (GECCO 2008), pp. 1759–1766, 2008


Bibtex Entry
@inproceedings{Lakhotia2008,
  author    = "Lakhotia, Kiran and Harman, Mark and McMinn, Phil",
  title     = "Handling Dynamic Data Structures in Search-Based Testing",
  booktitle = "Genetic and Evolutionary Computation Conference (GECCO 2008)",
  pages     = "1759--1766",
  year      = "2008",
  publisher = "ACM"
}