A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Bypassing Code Coverage Approximation Limitations via Effective Input-Based Randomized Test Case Prioritization
2013
2013 IEEE 37th Annual Computer Software and Applications Conference
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
doi:10.1109/compsac.2013.33
dblp:conf/compsac/JiangC13
fatcat:luhmjtbkyjgmnc5yotdq275c4a