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 Generation
xy
p call
=
param
param function
foo
(a)
Start
1
2
3
f
t
End
(c)
Start
1
2
3
t
f
End
(b)
foo foo
Fig. 5.7 Syntax trees with identical function call nodes but different function CFGs.
(a) Syntax tree for nodes
n
and
n
1
, respectively in
G
and
G
.(b) CFG for foo
in P. (c) CFG for foo’ in
P
.
down recursively identifying corresponding nodes that differ in P and
P
. Only tests that traverse such nodes are selected.
While traversing the CFGs, two nodes n N and n
N
are consid-
ered equivalent if the corresponding syntax trees are identical. Two syn-
tax trees are considered identical when their roots have the same labels
and the same corresponding descendants (see
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