|
à àà{
¦ | ¦ | Gd,k,u,c,p£ ¦ G £
¦ á
¦ D
r ¦ ¦
á
á Gá| !£ ¦ " ¦ ádu-path # $ # % ¦ á| ! " ¦ á| !
¦ ¦ á| !
á Gá| ! £ 2 ample: á Begin
&
'
(
)
End
From the figure, we see that variables A and B are defined on link (1,2). It is evident that any path taken for the graph will traverse through (1,2) . Hence the criterion for variables A & B as per ADUP is satisfied. But we have a redefinition at link (3,4). Variable C will not satisfy ADUP if only the path (1,3) is taken, thus violating the ADUP definition. ADUP becomes complicated when a variable is redefined in many places.
á Gá £ ¦ *#
¦ á
Begin
&
'
(
)
,
End
+
# " G'#(#)£ G'#)£ + á #
# G)#,£ G'#(#)£G'#)£
á Gá| ! £ 2 ample: á Begin
&
'
(
)
End
From the figure, we see that variables A and B are defined on link (1,2). It is evident that any path taken for the graph will traverse through (1,2) . Hence the criterion for variables A & B as per ADUP is satisfied. But we have a redefinition at link (3,4). Variable C will not satisfy ADUP if only the path (1,3) is taken, thus violating the ADUP definition. ADUP becomes complicated when a variable is redefined in many places.
á - Gá! .D£ ¦ +
# # ¦ Gá! .D£ # "
+
#
" #
á - Gá! .D £ Flow graph annotated for variable Z
! !! ( 0 ' ) 2 Begin & ,
3 End
Z
¦ + Gá! .D£ # !" + !" # "
¦ / $ G&#'£#G(#)£#G)#,£#G,#0£
1 $ G'#(£#G0#2£#G #3£
1#
"
á - GáD "!£ ¦ + # #
G $ £ ¦ | GáD .!£
á - GáD "! £ Flow graph annotated for variable Y Begin
&
) ' ( , Y Z
End
&5
3
2
0
¦ á #áD 4 G&#'#(#)#2# #3#&5£
G)#,#0#2£ ¦ + # " +
" #"
* #GáD .!£ G&#'#(#)#2# #3#&5£
á | Gá|£ ¦ á| $ GáD .!£ Gá! .D£ ¦ | á| G £
G£ UU efer the earlier slide for fig. ¦ G&#'#(#)#,#0#2# #3#&5£ á| 4 1# 6 á| # 6 á| $ GáD .!£ Gá! .D£ ¦ 7
á !
- ¦ + # !" ¦ + !" # G £ ¦ | á! Gá! .D£ # " " á! $ Gá! .D£
á D - ¦ á áD ¦ | áD GáD .!£ # " " ¦ + G £ áD $ GáD .!£
r
àhis shows the relative strength of data flow & control flow testing strategies.
àest cases are based on the elative strength of
testing strategies.
! "
G G
àhe strength of the testing strategies reduces along the Direction of the arrow. For example, All-Uses is weaker than All DU paths.
| 888| $
m 6ote - $ 88
