Skip to Main Content
Foundations of Software Testing: Fundamental Algorithms and Techniques
book

Foundations of Software Testing: Fundamental Algorithms and Techniques

by Aditya P. Mathur
March 2007
Intermediate to advanced content levelIntermediate to advanced
709 pages
20h 23m
English
Pearson India
Content preview from 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
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson

Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson

Aditya P. Mathur
Fundamentals of Computer Programming and IT by Pearson

Fundamentals of Computer Programming and IT by Pearson

Ashok Namdev Kamthane, Rohit Khurana

Publisher Resources

ISBN: 9788131707951