EvoSuite: automatic test suite generation for object-oriented software
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
On parameter tuning in search based software engineering
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
Search-based system testing: high coverage, no false alarms
Proceedings of the 2012 International Symposium on Software Testing and Analysis
Grouping target paths for evolutionary generation of test data in parallel
Journal of Systems and Software
Hi-index | 0.00 |
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. While 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 search lengths. Experiments on a set of difficult search targets selected from several open source and industrial projects show that the important choice in search-based testing is not the length of test cases, but how to make sure that this length does not become bloated.