Research Article
A Model Independent S/W Framework for Search-Based Software Testing
Algorithm 2
Pseudocode of local search algorithm.
(16) Test case set | (17) for each coverage do | (18) Find start node, | (19) repeat | (20) Finding 100 neighbors by adding one step into of | (21) Select the best fitness neighbor among the 100 neighbors | (22) If the best fitness neighbor is is useful then | (23) the best fitness neighbor | (24) else | (25) break | (26) end if | (27) until satisfy or reach maximum iteration | (28) of | (29) end for |
|