⇒A path predicate expression is a set of Boolean expressions, all of which must be satisfied to achieve the selected path
Example:
X1 + 3X2 + 17 >= 0
X3 = 17
X4 - X1 >= 14X2
⇒Any set of input values that satisfy all of the conditions of the path predicated expression will force the routine to the path
⇒Sometimes a predicate can have an OR in it
Example:
A: X5 > 0 E: X6 < 0
B: X1 + 3X2 + 17 >= 0 B: X1 + 3X2 + 17 >= 0
C: X3 = 17 C: X3 = 17
D: X4 - X1 >= 14X2 D: X4 - X1 >= 14X2
⇒Boolean algebra notation to denote the Boolean expression is:
ABCD + EBCD = (A + E) BCD
Example:
X1 + 3X2 + 17 >= 0
X3 = 17
X4 - X1 >= 14X2
⇒Any set of input values that satisfy all of the conditions of the path predicated expression will force the routine to the path
⇒Sometimes a predicate can have an OR in it
Example:
A: X5 > 0 E: X6 < 0
B: X1 + 3X2 + 17 >= 0 B: X1 + 3X2 + 17 >= 0
C: X3 = 17 C: X3 = 17
D: X4 - X1 >= 14X2 D: X4 - X1 >= 14X2
⇒Boolean algebra notation to denote the Boolean expression is:
ABCD + EBCD = (A + E) BCD
0 comments:
Post a Comment