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
Once the graphical model has been built, any one of the four predicate-
based test-generation procedures introduced in this section can be ap-
plied for test generation. Exercise 2.42 is to help you understand how a
combination of cause–effect graphs and predicate testing works.
2.7.7 FAULT PROPAGATION
We now explain the notion of fault propagation that forms the basis
of the four predicate test-generation algorithms described in this sec-
tion. Let p
r
be a predicate, simple or compound, and p
c
a compo-
nent of p
r
. Each node in the abstract syntax tree of a predicate is
a component of that predicate. For example, as in Figure 2.17, pred-
icate p :(a + b) < c ∧¬p r > s contains the following six compo-
nents: a + b < c, , ¬, p, ,and
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