Foundations of Software Testing: Fundamental Algorithms and Techniques

Test Selection, Minimization, and Prioritization

While the above example might seem trivial, it does point to the

weakness of test minimization. Situations depicted in this example could

arise in different forms in realistic applications. Hence, it is recom-

mended that minimization be carried out with caution. Tests discarded

by a minimization algorithm must be reviewed carefully before being

truely discarded.

5.4.5 TEST PRIORITIZATION

One approach to RTS is through test prioritization. In this approach, a

suitable metric is used to rank all tests in T

r

(see Figure 5.4). A test with

the highest rank has the highest priority, the one with the next highest

rank has the second highest priority, and so on. Prioritization does not

eliminate any test from