Bypassing code coverage approximation limitations via effective input-based randomized test case prioritization

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)22_Publication in policy or professional journal

11 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Article number6649820
Pages (from-to)190-199
Journal / PublicationProceedings - International Computer Software and Applications Conference
Publication statusPublished - 2013

Conference

Title2013 IEEE 27th International Parallel and Distributed Processing Symposium Workshops and PhD Forum, IPDPSW 2013
PlaceUnited States
CityBoston, MA
Period20 - 24 May 2013

Abstract

Test case prioritization assigns the execution priorities of the test cases in a given test suite with the aim of achieving certain goals. Many existing test case prioritization techniques however assume the full-fledged availability of code coverage data, fault history, or test specification, which are seldom well-maintained in many software development projects. This paper proposes a novel family of LBS techniques. They make adaptive tree-based randomized explorations with an adaptive randomized candidate test set strategy to diversify the explorations among the branches of the exploration trees constructed by the test inputs in the test suite. They get rid of the assumption on the historical correlation of code coverage between program versions. Our techniques can be applied to programs with or without any previous versions, and hence are more general than many existing test case prioritization techniques. The empirical study on four popular UNIX utility benchmarks shows that, in terms of APFD, our LBS techniques can be as effective as some of the best code coverage-based greedy prioritization techniques ever proposed. We also show that they are significantly more efficient and scalable than the latter techniques. © 2013 IEEE.

Research Area(s)

  • Adaptive test case prioritization, Regression testing