arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.08446cs.SE
收藏

最优路径的最小测试路径数及其它结构覆盖准则

Minimum Number of Test Paths for Prime Path and other Structural Coverage Criteria

Anurag Dwarakanath, Aruna Jankiti

摘要:

被测软件系统可以被建模为一个由一组顶点(V)和一组边(E)组成的图。测试用例是图上满足特定测试标准的测试路径。在本文中,我们提出了一种方法,以实现最小数量的测试路径需要覆盖不同的结构覆盖标准。我们的方法可以适应总理路径,边对,简单和完整的往返,边缘和节点覆盖标准。我们的方法通过将图转化为流图并求解最小流问题来获得最优解。我们提出了一个算法的最小流问题,匹配的最佳已知的解决方案的复杂性$O(|V| |E|)$。我们的方法是通过两组测试进行评估。首先,我们测试代表实际软件的图形。在第二个测试中,我们创建不同复杂度的随机图。在每个测试中,我们测量测试路径的数量,测试路径的长度,最小测试路径数量的下限和执行时间。

英文摘要:

The software system under test can be modeled as a graph comprising of a set of vertices, (V) and a set of edges, (E). Test Cases are Test Paths over the graph meeting a particular test criterion. In this paper, we present a method to achieve the minimum number of Test Paths needed to cover different structural coverage criteria. Our method can accommodate Prime Path, Edge-Pair, Simple & Complete Round Trip, Edge and Node coverage criteria. Our method obtains the optimal solution by transforming the graph into a flow graph and solving the minimum flow problem. We present an algorithm for the minimum flow problem that matches the best known solution complexity of $O(|V| |E|)$. Our method is evaluated through two sets of tests. In the first, we test against graphs representing actual software. In the second test, we create random graphs of varying complexity. In each test we measure the number of Test Paths, the length of Test Paths, the lower bound on minimum number of Test Paths and the execution time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑