Premium
Handling test length bloat
Author(s) -
Fraser Gordon,
Arcuri Andrea
Publication year - 2013
Publication title -
software testing, verification and reliability
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.216
H-Index - 49
eISSN - 1099-1689
pISSN - 0960-0833
DOI - 10.1002/stvr.1495
Subject(s) - computer science , context (archaeology) , set (abstract data type) , software , test (biology) , code coverage , object (grammar) , source code , test case , code (set theory) , algorithm , data mining , artificial intelligence , programming language , machine learning , biology , paleontology , regression analysis
SUMMARY The length of test cases is a little investigated topic in search‐based test generation for object‐oriented software, where test cases are sequences of method calls. Although intuitively longer tests can achieve higher overall code coverage, there is always the threat of bloat – a complex phenomenon in evolutionary computation, where the length abnormally grows over time. In this paper, we show that bloat indeed also occurs in the context of test generation for object‐oriented software. We present different techniques to overcome the problem of length bloat, and evaluate all possible combinations of these techniques using different starting lengths for the search. Experiments on a set of difficult search targets, selected from several open source and industrial projects, show that controlling bloat with the appropriate techniques can significantly improve the search performance. Copyright © 2013 John Wiley & Sons, Ltd.