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

Algorithm 3

Dynamic variable ordering.

Input  FV: the set of future variables

   𝐷_𝑖: the domain of 𝑥_𝑖 (𝑥_𝑖∈ FV)

   (𝑛_𝑞𝑎,𝑛_𝑞𝑎+1) (𝑎∈[1,𝑘]): 𝑘 branches along the path

Output  𝑄_𝑖: a queue of FV

Begin

(1) 𝑄_𝑖←  quicksort FV,𝐷_𝑖;

(2) for  𝑖→1: 𝑄_𝑖

(3)   if  𝐷_𝑖≠𝐷_𝑗 (𝑗>𝑖, 𝑥_𝑖, 𝑥_𝑗∈𝑄_𝑖)

(4)    break;

(5)   else  for (𝑛_𝑞𝑎,𝑛_𝑞𝑎+1) (𝑎∈[1,𝑘])

(6)     if (rank(𝑛_𝑞𝑎,𝑛_𝑞𝑎+1)(𝑥_𝑖) = rank(𝑛_𝑞𝑎,𝑛_𝑞𝑎+1)(𝑥_𝑗))

(7)       𝑎++;

(8)     else permutate 𝑥_𝑖, 𝑥_𝑗 by rank(𝑛_𝑞𝑎, 𝑛_𝑞𝑎+1);

(9)     break;

(10) return 𝑄_𝑖;

End