Automated Test Data Generation for Coverage: Haven't We Solved This Problem Yet?

Kiran Lakhotia, Phil McMinn, Mark Harman

Research output: Chapter in Book/Report/Conference proceedingConference paper

50 Citations (Scopus)

Abstract

Whilst there is much evidence that both concolic and search based testing can outperform random testing, there has been little work demonstrating the effectiveness of either technique with complete real world software applications. As a consequence, many researchers have doubts not only about the scalability of both approaches but also their applicability to production code. This paper performs an empirical study applying a concolic tool, CUTE, and a search based tool, AUSTIN, to the source code of four large open source applications. Each tool is applied 'out of the box'; that is without writing additional code for special handling of any of the individual subjects, or by tuning the tools' parameters. Perhaps surprisingly, the results show that both tools can only obtain at best a modest level of code coverage. Several challenges remain for improving automated test data generators in order to achieve higher levels of code coverage.
Original languageEnglish
Title of host publicationUnknown
Place of PublicationLOS ALAMITOS
PublisherIEEE COMPUTER SOC
Pages95 - 104
Number of pages10
ISBN (Print)978-0-7695-3820-4
DOIs
Publication statusPublished - 2009
EventProceedings of 2009 Testing: Academic and Industrial Conference - Practice and Research Techniques - Windsor, ENGLAND
Duration: 4 Sept 20096 Sept 2009

Publication series

Name2009 TESTING: ACADEMIC AND INDUSTRIAL CONFERENCE-PRACTICE AND RESEARCH TECHNIQUES, TAIC PART 2009

Conference

ConferenceProceedings of 2009 Testing: Academic and Industrial Conference - Practice and Research Techniques
CityWindsor, ENGLAND
Period4/09/20096/09/2009

Fingerprint

Dive into the research topics of 'Automated Test Data Generation for Coverage: Haven't We Solved This Problem Yet?'. Together they form a unique fingerprint.

Cite this