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

Algorithm 7

Maintaining path consistency.

Input   𝐷¹: the domain of all variables before checking path consistency

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

Output  𝐷^𝑘+1: the reduced domain of all variables after a successful path consistency check

   (𝑛_𝑞𝑎, 𝑛_𝑞𝑎+1): the conflicted branch spotted by path consistency check

Begin

(1) for 𝑎→1: 𝑘

(2)   calculate Br(𝑛_𝑞𝑎, 𝑛_𝑞𝑎+1) with 𝐷^𝑎;

(3)   if (Br(𝑛_𝑞𝑎,𝑛_𝑞𝑎+1) = true)

(4)    𝐷^𝑎+1⊑𝐷^𝑎;

(5)   else return (𝑛_𝑞𝑎, 𝑛_𝑞𝑎+1);

(6) path consistent ← true;

(7) return  𝐷^𝑘+1;

End