Algorithms for compacting error traces

In this paper, we present a concept of compacting the error traces generated by pseudo-random/random simulations. The new shorter error trace not only decreases the time of the user´s debugging process but also reduces the simulation time required to verify the bug fixes. Two algorithms, CET1 and CET2, are presented to perform the task of compacting the error trace. Both algorithms first use an efficient approach to eliminate the redundant states, to generate the unique states of the error trace. Then, CET1 builds the connected graph of these unique states by computing the reachable states by one cycle for each unique state, and then applies Dykstra´s shortest path algorithm to find out the shortest error trace in the connected graph. Compared with CET1, CET2 computes the reachable states by one cycle for those unique states, when they are needed in Dykstra´s shortest path algorithm to find the shortest error trace. After finding the shorter trace, the corresponding input/output test vectors are generated. The experimental results show that both algorithms can reduce the length of error traces dramatically for most cases using reasonable memory. For cases requiring longer CPU time to find the shortest trace, CET2 is up to 37 times faster than CET1.