Path-Wise Test Data Generation Based on Heuristic Look-Ahead Methods

Algorithm 2

Irrelevant variable removal.

Input  Br(𝑛_𝑞𝑎,𝑛_𝑞𝑎+1) (𝑎∈[1,𝑘]): 𝑘 branching conditions along the path

   𝑋={𝑥₁,𝑥₂,…,𝑥_𝑛}: the set of input variables

Output 𝑋_rel: the set of relevant variables to the path

     𝑋_irrel: the set of irrelevant variables to the path

(1) 𝑋_rel←∅;

(2) 𝑋_irrel←∅;

(3) foreach  Br(𝑛_𝑞𝑎,𝑛_𝑞𝑎+1) (𝑎∈[1,𝑘])

(4)    if 𝑋_rel=𝑋

(5)      break;

(6)    else  if (𝑎_𝑗≠0)

(7)     𝑋_rel←𝑋_rel∪{𝑥_𝑗};

(8)  𝑋_irrel←𝑋−𝑋_rel;

(9) return  𝑋_rel,  𝑋_irrel;