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 from Requirements
C
1
C
2
C
3
Inputs to node a
10 0 0C
1
= 0, b = 0
20 0 1
30 1 0
40 1 1C
1
= 0, b = 1
51 0 0C
1
= 1, b = 0
61 0 1
71 1 0
Let us now generate tests using the heuristics applicable to this ex-
ample. First we note that node a matches the OR-node shown in the
top half of Table 2.4. As we want the state of node a to be 0, heuristic
H
1
applies in this situation. H
1
asks us to enumerate all combinations
of inputs to node a such that C
1
and node b are 0. There are two such
combinations: (0, 0) and (0, 1). These two combinations are listed in
the last column of the preceding table.
Next we consider each combination of nodes C
1
and b, one at a
time
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