Incremental Hashing for Spin

  title={Incremental Hashing for Spin},
  author={Viet Yen Nguyen and Theo C. Ruys},
This paper discusses a generalised incremental hashing scheme for explicit state model checkers. The hashing scheme has been implemented into the model checker Spin. The incremental hashing scheme works for Spin’s exhaustive and both approximate verification modes: bitstate hashing and hash compaction. An implementation has been provided for 32-bit and 64-bit architectures. We performed extensive experiments on the BEEM benchmarks to compare the incremental hash functions against Spin’s… CONTINUE READING


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 17 references

Recursive Hashing Functions for n-Grams

ACM Trans. Inf. Syst. • 1997
View 6 Excerpts
Highly Influenced

Integer Hash Function

Thomas Wang, • 2007
View 1 Excerpt

Dynamic Incremental Hashing in Program Model Checking

Electr. Notes Theor. Comput. Sci. • 2006
View 2 Excerpts

An Analysis of Bitstate Hashing

Formal Methods in System Design • 1998
View 1 Excerpt

Holzmann . An Analysis of Bitstate Hashing

J. Gerard
Formal Methods in System Design • 1998