Skip to Main Content
Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson
book

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

by Aditya P. Mathur
May 2024
Intermediate to advanced content levelIntermediate to advanced
765 pages
21h 57m
English
Pearson India
Content preview from Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson
Test Generation
XY
P CALL
PARAM
PARAM FUNCTION
fOO
A
3TART
F
T
%ND
C
3TART
T
F
%ND
B
fOO fOO
)LJ  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 fPP
in P. (c) CFG for fPP 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

Effective Software Testing, Video Edition

Effective Software Testing, Video Edition

Mauricio Aniche

Publisher Resources

ISBN: 9781299486720