A nearly memory-optimal data structure for sets and mappings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2648, Issue , 2003, Pages 136-150

  Geldenhuys, Jaco ^a   Valmari, Antti ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; INFORMATION THEORY; MAPPING;

BIT VECTOR; EXPERIMENTAL EVIDENCE; HASH TABLE; INFORMATION-THEORETIC LOWER BOUNDS; LOWER BOUNDS; MEMORY CONSUMPTION; MEMORY EFFICIENT;

STRUCTURAL OPTIMIZATION;

EID: 35248860224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44829-2_9     Document Type: Article

References (16)

1. T.M. Cormen, C.E. Leiserson, R.L. Rivest & C. Stein. Introduction to Algorithms, 2nd edition. The MIT Press. 2001.
2. J. Geldenhuys & P. J. A. de Villiers. Runtime efficient state compaction in SPIN. In Proc. 5th SPIN Workshop, LNCS #1680, pp. 12-21. Springer-Verlag. 1999.
3. P. Godefroid, G. J. Holzmann & D. Pirottin. State space caching revisited. In CAV'92: Proc. of the 4th Intl. Conf. on Computer-Aided Verification, LNCS #663, pp. 175-186. Springer-Verlag. 1992.
4. J. C. Grégoire. State space compression with GETSs. In Proc. 2nd SPIN Workshop, Held Aug 1996, DIMACS Series No. 32, pp. 90-108. AMS. 1997.
5. G. J. Holzmann. On limits and possibilities of automated protocol analysis. In PSTV'87: Proc. 7th Intl. Conf. on Protocol Specification, Testing, and Verification, pp. 339-344. Elsevier. 1987.
6. G. J. Holzmann, P. Godefroid & D. Pirottin. Coverage preserving reduction strategies for reachability analysis. In PSTV'92: Proc. 12th Intl. Conf. on Protocol Specification, Testing, and Verification, pp. 349-363. Elsevier. 1992.
7. G. J. Holzmann. State compression in SPIN: recursive indexing and compression training runs. In Proc. 3rd SPIN Workshop. 1997.
8. G. J. Holzmann & A. Puri. A minimized automaton representation of reachable states. Software Tools for Technology Transfer, 2(3), pp. 270-278. Springer-Verlag. 1999.
9. D. E. Knuth. The Art of Computer Programming, Vol. 3: Searching and Sorting. Addison-Wesley. 1973.
10. A. Papoulis. Poisson Process and Shot Noise. Ch. 16 in Probability, Random Variables, and Stochastic Processes, 2nd ed., pp. 554-576. McGraw-Hill. 1984.
11. B. Parreaux. Difference compression in SPIN. In Proc. 4th SPIN Workshop. 1998.
12. P. E. Pfeiffer & D. A. Schum. Introduction to Applied Probability. Academic Press. 1973.
13. U. Stern & D. L. Dill. Improved probabilistic verification by hash compaction. In CHARME'95: Advanced Research Working Conf. Correct Hardware Design and Verification Methods, LNCS #987, pp. 206-224. Springer-Verlag. 1995.
14. http://www.cs.tut.fi/ohj/VARG/TVT/
15. W. C. Visser. Memory efficient storage in SPIN. In Proc. 2nd SPIN Workshop, Held Aug 1996, DIMACS Series No. 32, pp. 21-35. AMS. 1997.
16. P. Wolper & D. Leroy. Reliable hashing without collision detection. In CAV'93: Proc. of the 5th Intl. Conf. on Computer-Aided Verification, LNCS #697, pp. 59-70. Springer-Verlag. 1993.