A Hybrid Intelligent Search Algorithm for Automatic Test Data Generation

Algorithm 1

BB-HC.

Input   : the path to be traversed

Output   : test data making feasible

Begin

(1) result←null;

(2) call Algorithm 2. Dynamic variable ordering;

(3) call Algorithm 3. Path tendency calculation;

(4) call Algorithm 4. Initial domain calculation;

(5) ← select();

(6) initial state ← (null, , , , active);

(7) ← initial state;

(8) while  ( ≠ null)

(9)    call Algorithm 5. Hill climbing;

(10)    if ( = (Pre, , , , inactive))

(11)      Pre← ;

(12)        ← (Pre, , , , active);

(13)      ;

(14)    else  ;

(15)      ;

(16)      ;

(17)      call Algorithm 2. Dynamic variable ordering;

(18)      call Algorithm 4. Initial domain calculation;

(19)      ;

(20)      ← (Pre, , , , active);

(21) final state ← ;

(22) return   result;

End