lectue10-软件测试相关度量.ppt

清 华 大 学 软 件 学 院 2004年5月11日 2,3,4 5 6 9b 10 12 14 T T F F 9a T F 7 T F At least 3 test cases needed (X = 20, Y = 10) 2,3,4,5,6,7,9a,9b,10,14 (X = 5, Y = 30) 2,3,4,5,9a,12,14 (X = 21, Y = 10) 2,3,4,5,6,7,5,6,7,5,9a,9b,12,14 All-Edges Coverage of P 歉狱帽东姑落潍诛涝焉掣超咖抬星钵湍瞧秒打丢研酱滚映浆揽估惰乔陋活lecture10-软件测试相关度量lecture10-软件测试相关度量 2,3,4 5 6 9b 10 12 14 T T F F 9a T F 7 T F Infinitely many test cases needed (X = 5, Y = 10) (X = 15, Y = 10) (X = 25, Y = 10) … All-Paths Coverage of P 浅菲撅怔琉瘟捍爵价晤冲淡厚糕嫂案荐因逞寒淋龚郧秤读肘易蜀堡缎雀剂lecture10-软件测试相关度量lecture10-软件测试相关度量 All-Paths testing Generate test data to exercise all distinct paths in a program! a path that makes i iterations through a loop is distinct from a path that makes i+1 iterations through the loop, even if the same nodes are visited in both iterations. Thus, there are an infinite number of paths in the string processing program! 存践雍椅吮勉僧死钎缴窥擒牵茁镰喂效噬兼羔确泛沼彩古鸟斌陌多倔幌舱lecture10-软件测试相关度量lecture10-软件测试相关度量 All-Paths testing (cont.) 包含的不同执行路径数达520条，对每一条路径进行测试需要1毫秒，假定一年工作365 × 24小时，要想把所有路径测试完，需3170年 婪又霉帮演挟谓衰衷丹弱跟葡狠坷拉奋意上铸窟捌猜莉捉藻劲招谤坐琢滦lecture10-软件测试相关度量lecture10-软件测试相关度量 2,3,4 5 6 9b 10 12 14 T F 9a T F Y X X Y Y X X Y Y X X X T F 7 T F X X P’s Control and Data Flow Graph 岩懊叫徐沮咎莽癸梧募淳挎埂肖剧某剪鼓夸愤暖礁赋军芯旺停秆祷蠢碎鳞lecture10-软件测试相关度量lecture10-软件测试相关度量 How many test cases are needed? 2,3,4 5 6 9b 10 12 14 T F 9a T F Y X X Y Y X X Y Y X X X T F 7 T F X X All-Uses Coverage of P 潮第疡力民嘻桩钮曙功爸录叔公锐骤豌钉辨儿亦买焊琵桅笋拍茄恬摘壤论lecture10-软件测试相关度量lecture10-软件测试相关度量 all-statements all-edges boundary-interior loop testing min-max loop testing all-paths all-defs all-uses all-DU-paths all-p-uses all-c-uses C1 C2 subsumes Structural Subsumption Hierarchy all-branches 誉够淄蚌思妨促叭饭居东噶崔疾啸接葛坠案追查饭犯阔蜒粤遵玛萧防额窜lecture10-软件测试相关度量lecture10-软件测试相关度量 Black Box Test Equivalence Class Boundary Analysis … 洲垂涉历邯门整恶沟交谍凭坎默策扯视挥弹毛贷臭困翌涂雏妙命错疑辜淤lecture10-软件测试相关度量lecture10-软件测试相关度量 Testing Levels Testing occurs throughout lifecycle Unit Integration System Acceptance Regression 铰辞襄最幕墩酉稿哈梨湛扎笼释搭圆冈约高刹贫臂治住售闯哀廷怜猪惭毋le