2012 IEEE Fifth International Conference on Software Testing, Verification and Validation (2012)
Montreal, Quebec Canada
Apr. 17, 2012 to Apr. 21, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICST.2012.114
Although testing is a standard method for improving the quality of software, conventional testing methods often fail to detect faults. Concolic testing attempts to remedy this by automatically generating test cases to explore execution paths in a program under test, helping testers achieve greater coverage of program behavior in a more automated fashion. Concolic testing, however, consumes a significant amount of computing time to explore execution paths, which is an obstacle toward its practical application. To address this limitation, we have developed a scalable distributed concolic testing framework that utilizes large numbers of computing nodes to generate test cases in a scalable manner. In this paper, we present the results of an empirical study that shows that the proposed framework can achieve a several orders-of-magnitude increase in test case generation speed compared to the original concolic approach, and also demonstrates clear potential for scalability.
Y. Kim, G. Rothermel and M. Kim, "A Scalable Distributed Concolic Testing Approach: An Empirical Evaluation," 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation(ICST), Montreal, Quebec Canada, 2012, pp. 340-349.