本文共 1790 字,大约阅读时间需要 5 分钟。
最近在复习软件测试的考试,每次到白盒测试这里都要为这几种逻辑覆盖方法感到头疼,这次终于决定好好整理出来。
逻辑覆盖是通过对程序逻辑结构的遍历实现程序的覆盖。它是一系列测试过程的总称,这组测试过程逐渐进行越来越完整的通路测试。
根据覆盖目标的不同和覆盖源程序语句的详尽程度,逻辑覆盖又可分为:语句覆盖,判定覆盖,条件覆盖,条件/判定覆盖,条件组合覆盖,路径覆盖这里以一个题目引入:
if (a>1) and (b = 0)then x = x / aif (a = 2) or (x > 1)then x = x+ 1
程序流程图如下:
注:[可执行语句:流程图中的矩形;判定:流程图中的菱形]
分析:需要覆盖的可执行语句为x = x / a 和 x = x + 1
测试用例如下:
a = 2, b = 0, x = 3 覆盖路径:a-c-e
分析:需要覆盖的路径为:a-c-e和a-b-d 或 a-b-e和a-c-d
测试用例如下:
答案1a = 2, b = 0, x = 3 覆盖路径:a-c-ea = 1, b = 0, x = 1 覆盖路径:a-b-d答案2a = 2, b = 1, x = 1 覆盖路径:a-b-ea = 3, b = 0, x = 3 覆盖路径:a-c-d
分析:需要满足的判定为:判定一(a > 1, a <= 1, b = 0, b != 0) ; 判定二(a = 2, a != 2, x > 1, x <= 2)
测试用例如下:
答案1a = 2, b = 0, x = 3 取到a>1(同时满足a=2), b = 0, x>1a = 1, b = 1, x = 1 取到a <= 1(同时满足a!=2), b != 0, x <= 2答案2a = 1, b = 0, x = 3 取到a <= 1(同时满足a!=2), b = 0, x >1a = 2, b = 1, x = 1 取到a>1(同时满足a=2), b != 0, x<=2
分析:
需要覆盖的路径为:a-c-e和a-b-d 或 a-b-e和a-c-d
需要满足的判定为:判定一(a > 1, a <= 1, b = 0, b != 0) ; 判定二(a = 2, a != 2, x > 1, x <= 2)
测试用例如下:
a = 2, b = 0, x = 3 覆盖路径a-c-e 取到a>1(同时满足a=2), b = 0, x>1a = 1, b = 1, x = 1 覆盖路径a-b-d 取到a <= 1(同时满足a!=2), b != 0, x <= 2
分析:需要覆盖的条件组合为:
a > 1, b = 0a>1, b != 0a <= 1, b = 0a <= 1, b != 0a = 2, x > 1a = 2, x< = 1a != 2, x > 1a != 2, x <= 1
测试用例如下
a = 2, b = 0, x = 3 覆盖组合1,5a = 2, b = 1, x = 1 覆盖组合2,6a = 1, b = 0, x = 3 覆盖组合3,7a = 1, b = 1, x = 1 覆盖组合4,8
分析:需要覆盖的路径为:a-c-e、 a-b-d、 a-b-e、 a-c-d
a = 2, b = 0, x = 3 覆盖路径:a-c-ea = 1, b = 0, x = 1 覆盖路径:a-b-da = 2, b = 1, x = 1 覆盖路径:a-b-ea = 3, b = 0, x = 3 覆盖路径:a-c-d
转载地址:http://yznaf.baihongyu.com/