PHALANX: a graph-theoretic framework for test case prioritization

Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing different metrics requires different prioritization schemes (e.g., maximum coverage, dissimilar paths covered). This results in significant algorithmic and implementation complexity in the testing process associated with various metrics and prioritization schemes. In this paper, we present a novel approach to the test case prioritization problem that addresses this limitation. We devise a framework, Phalanx, that identifies two distinct aspects of the problem. The first relates to metrics that define ordering relations among test cases; the second defines mechanisms that implement these on test suites. We abstract the information into a test-case dissimilarity graph

• Type: Journal
• Year: 2008
• Where: SAC
• Authors: Murali Krishna Ramanathan, Mehmet Koyutürk, Ananth Grama, Suresh Jagannathan
• Keywords: Applied Computing, Prioritization Schemes, SAC 2008, Test Case, Test Case Prioritization