TY - GEN
T1 - CarFast
T2 - 20th ACM SIGSOFT International Symposium on the Foundations of Software Engineering, FSE 2012
AU - Park, Sangmin
AU - Hossain, B. M.Mainul
AU - Hussain, Ishtiaque
AU - Csallner, Christoph
AU - Grechanik, Mark
AU - Taneja, Kunal
AU - Fu, Chen
AU - Xie, Qing
PY - 2012
Y1 - 2012
N2 - Test coverage is an important metric of software quality, since it indicates thoroughness of testing. In industry, test coverage is often measured as statement coverage. A fundamental problem of software testing is how to achieve higher statement coverage faster, and it is a difficult problem since it requires testers to cleverly find input data that can steer execution sooner toward sections of application code that contain more statements. We created a novel fully automatic approach for aChieving higher stAtement coveRage FASTer (CarFast), which we implemented and evaluated on twelve generated Java applications whose sizes range from 300 LOC to one million LOC. We compared CarFast with several popular test case generation techniques, including pure random, adaptive random, and Directed Automated Random Testing (DART). Our results indicate with strong statistical significance that when execution time is measured in terms of the number of runs of the application on different input test data, CarFast outperforms the evaluated competitive approaches on most subject applications.
AB - Test coverage is an important metric of software quality, since it indicates thoroughness of testing. In industry, test coverage is often measured as statement coverage. A fundamental problem of software testing is how to achieve higher statement coverage faster, and it is a difficult problem since it requires testers to cleverly find input data that can steer execution sooner toward sections of application code that contain more statements. We created a novel fully automatic approach for aChieving higher stAtement coveRage FASTer (CarFast), which we implemented and evaluated on twelve generated Java applications whose sizes range from 300 LOC to one million LOC. We compared CarFast with several popular test case generation techniques, including pure random, adaptive random, and Directed Automated Random Testing (DART). Our results indicate with strong statistical significance that when execution time is measured in terms of the number of runs of the application on different input test data, CarFast outperforms the evaluated competitive approaches on most subject applications.
UR - http://www.scopus.com/inward/record.url?scp=84871333009&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84871333009&partnerID=8YFLogxK
U2 - 10.1145/2393596.2393636
DO - 10.1145/2393596.2393636
M3 - Conference contribution
AN - SCOPUS:84871333009
SN - 9781450316149
T3 - Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, FSE 2012
BT - Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, FSE 2012
Y2 - 11 November 2012 through 16 November 2012
ER -