| 
|
QuoteRef: dillPC4_2004
topics >
all references >
ThesaHelp:
references i-l
Topic:
model checker
Topic:
hash filter
Topic:
hash table and hash functions
Reference
Dillinger, P.C., Manolios, P., "Fast and accurate bitstate verification for SPIN", in Graf, S., Mounier, L. (ed.), Model Checking Software. 11th International SPIN Workshop, Barcelona, Spain, April 2004, Springer, LNCS 2989, pp. 57-75. Google
Notes
http://www.cc.gatech.edut/~peterd/3spin
57 ;;Quote: explicit-state model checking with bitstate verification and Bloom filters; e.g., Spin, cache coherence, and network protocols
58 ;;Quote: computing hash values is the most expensive operation in a model checker
65 ;;Quote: for open-addressing, triple hashing modifies the increment as well as the hash value; much higher accuracy for Bloom filters
66 ;;Quote: Jenkins' LOOKUP2 is a high quality, fast hash function; e.g., used in Spin
66 ;;Quote: triple hashing with LOOKUP2 generating 96 bits of data; as fast as double hashing with 1/13th as many omissions
70 ;;Quote: avoid MOD operations within the iteration part of a Bloom filter
ThesaHelp: references i-l (342 items)
Topic: model checker (49 items)
Topic: hash filter (18 items)
Topic: hash table and hash functions (41 items)