一种覆盖行为独立性的Prime测试路径生成技术  

A Test Path Generation Algorithm for Satisfying Decision Independence

作　　者：刘秀青 杜军威[1] 李彦霖 

机构地区：[1]青岛科技大学信息科学技术学院,青岛266061

出　　处：《计算机与数字工程》2018年第1期170-176,共7页Computer & Digital Engineering

基　　金：国家自然科学基金项目(编号:61273180);山东省自然科学基金项目(编号:ZR2012FL17)资助

摘　　要：基于图论的路径分析是系统行为分析与监测的重要技术手段。基本路径覆盖技术是常用的路径分析技术,而基本路径仅考虑路径间独立性分析,缺乏对边对、环路等路径特征分析。Paul提出一种Prime路径生成技术,以最大简单路径覆盖为目标,有效检测边对、环路等路径缺陷问题,然其没有考虑路径独立性。论文提出一种满足行为独立性覆盖的Prime路径生成技术,采用启发式算法在生成独立路径时选择满足行为关联性覆盖的路径生成,在保证覆盖充分性的同时,使得测试路径数和总测试路径长度在可测性前提下保持在合理的范围,从而保证测试覆盖度的前提下测试路径优化。Path analysis based on graph theory is the important technical method to analyze and monitor system behavior. The basic path coverage technique is commonly used in the path analysis. In the basic path,the independence of paths is analyzed,while ignoring the analysis of other characteristics,such as edge-pair,loops etc. Paul proposes a Primary path generation technique,aiming at maximum simple path coverage. The method can effectively detect the edge-pair,loops and other defects of path,while ignoring the independence of path. This paper presents a Primary path generation technique to satisfy the behavior inde-pendence coverage. The technique adapts the heuristic algorithm to generate independent paths and selects the paths satisfied behavior relevance coverage from them. This method can guarantee coverage adequacy. In the meantime,it can keep the total number andtotal length of test paths within a reasonable range on the premise of testability,and it can optimize the test path on the premise of guaranteeing the test coverage.

关 键 词：基本路径测试 Prime路径 圈复杂度 测试代价 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]