New Methods for Sequential Hashing with Supertrace
Thomas Eckerle Juergen, A Lais · 1998
Partial search methods like bitstate hashing, or supertrace, allow formal verification techniques to be applied to problems which normally could not be solved by exhaustive verification. A high coverage (defined as the percentage of the reachable states actually explored by the verifier) is important since the higher the coverage the lower the probability that a protocol error is not detected. In literature sequential hashing is proposed to improve the coverage of supertrace (i.~e. start repeatedly supertrace by using different hash functions). Since supertrace is included in many commercial and noncommercial verification tools, it is important to know where its limitations are and where there is potential for possible improvements.