Arunkumar Khannur's Software Testing Knowledge Center

4.7 Path Sensitizing

If we find input values so as to fulfil alternate conditions in predicate expressions so as to execute all paths, then we say that the path is achievable else the path is unachievable. Path sensitization is the very act of finding a set of input values so as to find solutions to the path predicate expression. By using notations of capital letters to represents the predicates, by representing the truth value of the predicate by the unbarred letter and false value by barred letter. It is possible to represent control flow graph by using predicate notation.

By considering Fig. 4.8 Graphical Representation with labelled links for Fig. 4.7 Example that has Complete Paths or Entry/Exit Paths from node 1 to node 11 as follows:


Example. Now using predicate notations we can have Fig. 4.13 Predicate Notational Representation for Fig. 4.8
Fig. 4.13 Predicate Notational Representation for Fig. 4.8
Using Fig. 4.9 Predicate Notational Representation for Fig. 4.8 we can have predicate values for the given path as follows:

In order to execute the predicate paths, we need to select appropriate values.
For example, to execute the path “abcegikl” we need to select input values so that predicate expression A shall return truth value and predicate expression B shall return false value. So one set of values for (x,y) variables to fulfil these conditions are
x = 1 and y =1
By following this logic the input values for the paths and to fulfil predicate values are as shown in following tables:
Khannur's Book
Arunkumar Khannur, Software Testing - Techniques and Applications, Published by Pearson Publications, 2011 (ISBN:978-81-317-5836-6; Pages:341 + xxii)
Follow Khannur
Khannur's Company
ISQT Process & Consulting Services Pvt. Ltd., Bangalore, INDIA
Khannur's Software Testing Forum
 Contact Khannur
ISQT Process & Consulting Services Pvt. Ltd.
#732, 1st Floor, 12th Main,
3rd Block, Rajajinagar,
Bangalore - 560010, INDIA
Phone: +91 80 23012511
Skype: arun.isqt