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
causes the traversal of node 4 in Figure 5.10. However, the traversal
of node 4 does not affect the computation of w at node 8 and hence,
when using the dynamic slice approach, t is not included in T
. Note
that node 4 is not in DS(t) with respect to variable w at line 8 and
hence t should not be included in T
.
5.6.4 POTENTIAL DEPENDENCE
The dynamic slice contains all statements in trace(t) that had an affect
on program output. However, there might be a statement s in the trace
that did not affect program output but may affect if changed. By not
including s in the dynamic slice we exclude t from the
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