Foundations of Software Testing: Fundamental Algorithms and Techniques

Test Selection, Minimization, and Prioritization

The procedure for obtaining a dynamic slice from an RDDG remains

the same as described in Section 5.6.2. To obtain the relevant slice one

first discovers the potential dependences and then computes the relevant

slice as illustrated in Section 5.6.5.

5.7 SCALABILITY OF TEST-SELECTION ALGORITHMS

The execution slice and dynamic-slicing techniques described above have

several associated costs. First, there is the cost of doing a complete sta-

tic analysis of program P that is modified to generate P



. While there

exist several algorithms for static analysis to discover data and control

dependence, they are not always precise especially for languages that of-

fer pointers. Second, there is the run time overhead ...