### Table 3: TC with no additional heuristics.

"... In PAGE 8: ... We also show the result obtained by using Jungle, the widening based on type jungles. Unmodi ed TC and Depth-2 As can be seen in Table3 and Table 4 the maximum intermediate type graph size is sometimes much larger than the sizes of the nal type graphs. Both Depth-2 and TC times out on some of the benchmarks even though TC behaves better.... ..."

### Table 6: Space Complexity using general search algorithm after adding the additional heuristic.

"... In PAGE 4: ... Hence if we add this heuristic to the A* algorithm, it should improve the performance of the A* algorithm. Table6 shows the Maximum paths and Maximum nodes ... ..."

### Table 7 shows the time taken to compute optimal paths for different Manhattan distances after adding the additional heuristic to the A* algorithm.

"... In PAGE 5: ... Table7 : Time Complexity using the A* algorithm after adding the additional heuristic. Comparing table 3 and table 7 it can be concluded that adding this additional heuristic has improved the performance of the A* algorithm in terms of time taken.... ..."

### Table 8 shows the Maximum paths and Maximum nodes to compute optimal paths for different Manhattan distances after adding the additional heuristic to the general search algorithm.

"... In PAGE 5: ...125 58 26 150 115 31 200 273 41 220 347 45 225 351 46 230 374 47 Table8 : Space Complexity using the A* algorithm after adding the additional heuristic. Comparing table 4 and table 8 it can be seen that the additional heuristic has decreased the number paths expanded by the A* algorithm even though there is no improvement in the maximum number of nodes expanded.... ..."

### Table 5 shows the time taken to compute optimal paths for different Manhattan distances after adding the additional heuristic to the general search algorithm.

"... In PAGE 4: ... Table5 : Time Complexity using general search algorithm after adding the additional heuristic. Comparing the values in table 5 and table 1, we see that adding this heuristic has certainly improved the performance of the general search algorithm by decreasing the time taken to compute paths.... ..."

### Table 4. Test sequence increase with non-random filling heuristics % of additional patterns

"... In PAGE 5: ... In fact, a non-random filling solution may increase the resulting test sequence compared to the initial one using random filling assignment of don apos;t cares. Table4 reports the increase of test length obtained with the three non-random filling heuristics compared to the initial test sequence with random filling. Table 4.... ..."

### Table 4 List of filters (sieves) applied to results. There are additional heuristics when the results are related to people. That is, since people tend feel less threatened when asking questions of colleagues, the positions in organisational hierarchy can be exploited.

"... In PAGE 5: ... The order that the results filters are applied depends on the user profiles and user information needs. Table4 shows the type of filters to ... ..."