MIAO Li, ZHANG Da-fang, JI jie, et al. Formal Analysis of Nondeterminism Path Test Problem and a Transform Algorithm[J]. Acta Electronica Sinica, 2005, 33(2): 258-261.
DOI:
MIAO Li, ZHANG Da-fang, JI jie, et al. Formal Analysis of Nondeterminism Path Test Problem and a Transform Algorithm[J]. Acta Electronica Sinica, 2005, 33(2): 258-261.DOI:
Formal Analysis of Nondeterminism Path Test Problem and a Transform Algorithm
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.