lecture10-软件测试相关度量.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 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 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 lo