
Measuring Internal Product Attributes ◾ 401
EXAMPLE 9.21
For the owgraph in Figure 9.16, we compute the minimum number of test
cases m for statement coverage using the tables in Appendix A.2:
m(F) = m(D
1
(D
0
;P
1
;D
2
),(m(D
0
(D
3
))
= m(D
0
;P
1
;D
2
) + m(D
0
(D
3
))
= max(m(D
0
),m(P
1
),m(D
2
)) + m(D
3
)
= max(1,1,1) + 1 = 2
EXAMPLE 9.22
Bertolino and Marre noted several problems with using some of the strate-
gies and their lower bound to drive test case selection (Bertolino and Marre
1995). For example, if a complex program is enclosed in a loop, then theo-
retically it is possible to satisfy branch coverage with a single path. In this
case, the lower bound of ...