Test Case Prioritization Using Relevant Slices

Abstract

Software testing and retesting occurs continuously during the software development lifecycle to detect errors as early as possible. The sizes of test suites grow as software evolves. Due to resource constraints, it is important to prioritize the execution of test cases so as to increase chances of early detection of faults. Prior techniques for test case prioritization are based on the total number of coverage requirements exercised by the test cases. In this paper, we present a new approach to prioritize test cases based on the coverage requirements present in the relevant slices of the outputs of test cases. We present experimental results comparing the effectiveness of our prioritization approach with that of existing techniques that only account for total requirement coverage, in terms of ability to achieve high rate of fault detection. Our results present interesting insights into the effectiveness of using relevant slices for test case prioritization.

A Hybrid Approach of Clustering and Time-Aware Based Novel Test Case Prioritization Technique

“…MC/DC is a very powerful technique for verification and it is found that if test cases meet MC/DC coverage need then they can detect important errors that can't be found by functional testing. Jeffrey et al presented a method of prioritization based on the relevant slices of outputs of various test cases [16]. This technique is a combination of total statement coverage criterion and also depends upon the number of statements covered by a test case that influence the output generated by that test case.…”

Analytical Review on Test Cases Prioritization Techniques: An Empirical Study

“…Among all these algorithms, GRASP surpassed the simulated annealing, genetic and greedy algorithm. Dennis et al [22] invented prioritization technique using relevant slice. A program includes a lot of statements.…”

Coverage-Based Clustering and Scheduling Approach for Test Case Prioritization

“…Jeffrey and Gupta [15] present an algorithm that prioritizes test cases which combined statements coverage and relevant slices of the outputs of test cases. Khalilian et al [16] prioritize test cases according to the available historical performance data which obtained from the previous test sessions.…”