非定态路径测试问题的分析与一种转换算法

Formal Analysis of Nondeterminism Path Test Problem and a Transform Algorithm

测试数据生成中使用静态分析法的主要问题之一是难以处理程序变量的不确定性 .本文对软件测试数据生成中的变量“不确定”问题进行了分析 ,认为该问题的实质是程序中变量本身的符号不确定性和程序的动态性 ,根据这个思路提出非定态路径、变符号变量、程序状态变量等概念 ,并将问题进行了形式化的描述 ,证明了非定态路径约束解空间可进一步划分为多个子空间 .在此结论的基础上 ,本文给出了一个将非定态路径测试转换为定态路径测试的算法 ,对非定态路径测试问题的理论分析和解决途径进行了有益的尝试 .

In the field of automatic test data generation, a difficult problem is the nondeterminism of program variable, e.g., array problem and pointer problem. Array variants and pointer variants are defined as a special kind of variants, variants with variable symbol, and a path with variants with variable symbol is defined as a nondeterministic path. Generating testing data of a path is finding an input that satisfies the path constraint condition. By proving the input space satisfying the constraint of a nondeterministic path can be further partitioned into many sub-spaces, the nondeterminism is avoided when test data is searched only in a sub-space in theory. An algorithm is presented to find a sub-space by program slicing.