Test Adequacy Assessment
execution of P against T, the following path is traversed:
(4UBSU,...,n
1
. p
1
, n
2
,..., p
k−1
n
k
,...,&OE)
where each p
i
for 1 ≤ i < k is a def–clear subpath from node n
i
to node
n
i+1
with respect to variable X
i
. If node n
k
ends in a predicate, then
C is considered covered only if upon the execution of P against T, the
following paths are traversed:
(4UBSU,...,n
1
, p
1
, n
2
,..., p
k−1
n
k
, r,...,&OE)
(4UBSU,...,n
1
, p
1
, n
2
,..., p
k−1
n
k
, s,...,&OE)
where p
i
s and p
i
s are def–clear subpaths for variable X
i
, and nodes r
and s are immediate successors of node n
k
. The above condition ensures
that the decision containing the last use of a variable along the chain is
covered, that is both branches out of the decision are taken. As shown
in Example 6.40, ...