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
Preliminaries
an immediate dominator to the node it dominates. Thus, among
other relations, we have idom(1, 2) and idom(4, end). Similarly,
from the postdominator tree, we obtain ipdom(4, 2) and ipdom
(End,4).
Given a dominator and a postdominator tree, it is easy to derive
the set of dominators and postdominators for any node. For exam-
ple, the set of dominators for node 4, denoted as dom(4), is {2, 1,
Start}. dom(4) is derived by first obtaining the immediate dom-
inator of 4 which is 2, followed by the immediate dominator of 2
which is 1, and finally the immediate dominator of 1 which is Start.
Similarly, we can derive the set of postdominators for node 2 as
{4, End}.
1.16 PROGRAM-DEPENDENCE GRAPH
A PDG for program P exhibits different kinds of dependencies ...
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