Gregory M. Kapfhammer

Test Suite Reduction and Prioritization with Call Trees

Adam Smith, Joshua Geiger, Gregory M. Kapfhammer, and Mary Lou Soffa. Test Suite Reduction and Prioritization with Call Trees (Tool Paper). In the Proceedings of the IEEE/ACM International Conference on Automated Software Engineering, Atlanta, Georgia, November 2007.

Related Projects: Kanonizo

Abstract

This paper presents a tool that (i) constructs tree-based models of a program's behavior during testing and (ii) employs these trees while reordering and reducing a test suite. Using either a dynamic call tree or a calling context tree, the test reduction component identifies a subset of the original tests that covers the same call tree paths. The prioritization technique reorders a test suite so that it covers the call tree paths more rapidly than the initial test ordering. In support of program and test suite understanding, the tool also visualizes the call trees and the coverage relationships. For a chosen case study application, the experimental results show that call tree construction only increases testing time by 13%. In comparison to the original test suite, the experiments show that (i) a prioritized suite achieves coverage much faster and (ii) a reduced test suite contains 45% fewer tests and consumes 82% less time.

[PDF] [PS] [BibTeX Entry] [Copyright Notice]

---

Links to this Page

• Kanonizo last edited on 21 October 2009 at 5:06 pm by 141.195.226.29
• Research Papers last edited on 20 October 2009 at 5:41 pm by 141.195.226.29
• Test Suite Reduction and Prioritization with Call Trees last edited on 17 May 2008 at 3:41 pm by aldenv29.allegheny.edu
• Evaluating Test Suite Prioritizations with Coverage Effectiveness last edited on 30 May 2008 at 2:00 pm by aldenv29.allegheny.edu
• Computer Science 580, Junior Seminar, Spring 2008 last edited on 29 May 2008 at 11:54 am by aldenv29.allegheny.edu