Handling dynamic data structures in search based testing

Authors:
Kiran Lakhotia;Mark Harman;Phil McMinn
Affiliations:
King's College London, London, United Kngdm;King's College London, London, United Kngdm;University of Sheffield, Sheffield, United Kngdm
Venue:
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Year:
2008

Citing 16
Cited 9

Automated Software Test Data Generation

IEEE Transactions on Software Engineering
Experimental results from an automatic test case generator

ACM Transactions on Software Engineering and Methodology (TOSEM)
Symbolic execution and program testing

Communications of the ACM
Generating Software Test Data by Evolution

IEEE Transactions on Software Engineering
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs

CC '02 Proceedings of the 11th International Conference on Compiler Construction
Evolutionary testing of classes

ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
DART: directed automated random testing

Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Search-based software test data generation: a survey: Research Articles

Software Testing, Verification & Reliability
Compositional dynamic test generation

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hybrid Concolic Testing

ICSE '07 Proceedings of the 29th international conference on Software Engineering
The Current State and Future of Search Based Software Engineering

FOSE '07 2007 Future of Software Engineering
A theoretical & empirical znalysis of evolutionary testing and hill climbing for structural test data generation

Proceedings of the 2007 international symposium on Software testing and analysis
Evacon: a framework for integrating evolutionary and concolic testing for object-oriented programs

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Generalized symbolic execution for model checking and testing

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
CUTE and jCUTE: concolic unit testing and explicit path model-checking tools

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Execution generated test cases: how to make systems code crash itself

SPIN'05 Proceedings of the 12th international conference on Model Checking Software

Solving string constraints lazily

Proceedings of the IEEE/ACM international conference on Automated software engineering
An empirical investigation into branch coverage for C programs using CUTE and AUSTIN

Journal of Systems and Software
FlagRemover: A testability transformation for transforming loop-assigned flags

ACM Transactions on Software Engineering and Methodology (TOSEM)
Search-based software testing and test data generation for a dynamic programming language

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Synthesizing method sequences for high-coverage testing

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Search based software engineering: techniques, taxonomy, tutorial

Empirical Software Engineering and Verification
Symbolic search-based testing

ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
An identification of program factors that impact crossover performance in evolutionary test input generation for the branch coverage of C programs

Information and Software Technology
An orchestrated survey of methodologies for automated software test case generation

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.