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

路径完整白盒测试的系统方法

Systematic Method for Path-Complete White Box Testing

Hanna Makaruk, Robert Owczarek, Nikita Sakhanenko

摘要:

本文提出了一种系统的、与语言无关的、用于白盒测试的寻找覆盖顺序程序代码的最小路径集的方法。执行集合中的所有路径也确保语句覆盖。执行错误标记代码中有问题的区域。该方法从程序的UML活动图开始。该图被转换为有向图:图的节点替代决策点和动作点;图的有向边替代动作箭头。独立路径的数量等于图的容易计算的圈复杂度。将向量与每条路径相关联创建路径向量空间。路径的独立性等价于向量的线性独立性。只要测试路径空间的任何基就足以完成这个过程。提出了一种有效的基路径选择算法。

英文摘要:

A systematic, language-independent method of finding a minimal set of paths covering the code of a sequential program is proposed for application in White Box testing. Execution of all paths from the set ensures also statement coverage. Execution fault marks problematic areas of the code. The method starts from a UML activity diagram of a program. The diagram is transformed into a directed graph: graph's nodes substitute decision and action points; graph's directed edges substitute action arrows. The number of independent paths equals easy-to-compute cyclomatic complexity of the graph. Association of a vector to each path creates a path vector space. Independence of the paths is equivalent to linear independence of the vectors. It is sufficient to test any base of the path space to complete the procedure. An effective algorithm for choosing the base paths is presented.

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

↑