{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:51:17Z","timestamp":1742932277243,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401179"},{"type":"electronic","value":"9783540448297"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44829-2_9","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T16:01:40Z","timestamp":1183478500000},"page":"136-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A Nearly Memory-Optimal Data Structure for Sets and Mappings"],"prefix":"10.1007","author":[{"given":"Jaco","family":"Geldenhuys","sequence":"first","affiliation":[]},{"given":"Antti","family":"Valmari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"key":"9_CR1","unstructured":"T. M. Cormen, C. E. Leiserson, R. L. Rivest & C. Stein. Introduction to Algorithms, 2nd edition. The MIT Press. 2001."},{"key":"9_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/3-540-48234-2_2","volume-title":"Proc. 5th Spin Workshop","author":"J. Geldenhuys","year":"1999","unstructured":"J. Geldenhuys & P. J. A. de Villiers. Runtime efficient state compaction in Spin. In Proc. 5th\n                        Spin\n                        Workshop, LNCS #1680, pp. 12\u201321. Springer-Verlag. 1999."},{"key":"9_CR3","series-title":"Lect Notes Comput Sci","first-page":"175","volume-title":"CAV\u201992: Proc. of the 4th Intl. Conf. on Computer-Aided Verification","author":"P. Godefroid","year":"1992","unstructured":"P. Godefroid, G. J. Holzmann & D. Pirottin. State space caching revisited. In CAV\u201992: Proc. of the 4th Intl. Conf. on Computer-Aided Verification, LNCS #663, pp. 175\u2013186. Springer-Verlag. 1992."},{"key":"9_CR4","unstructured":"J. C. Gr\u00e9goire. State space compression with GETSs. In Proc. 2nd\n                        Spin\n                        Workshop, Held Aug 1996, DIMACS Series No. 32, pp. 90\u2013108. AMS. 1997."},{"key":"9_CR5","unstructured":"G. J. Holzmann. On limits and possibilities of automated protocol analysis. In PSTV\u201987: Proc. 7th Intl. Conf. on Protocol Specification, Testing, and Verification, pp. 339\u2013344. Elsevier. 1987."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"G. J. Holzmann, P. Godefroid & D. Pirottin. Coverage preserving reduction strategies for reachability analysis. In PSTV\u201992: Proc. 12th Intl. Conf. on Protocol Specification, Testing, and Verification, pp. 349\u2013363. Elsevier. 1992.","DOI":"10.1016\/B978-0-444-89874-6.50028-3"},{"key":"9_CR7","unstructured":"G. J. Holzmann. State compression in Spin: recursive indexing and compression training runs. In Proc. 3rd\n                        Spin\n                        Workshop. 1997."},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/s100090050034","volume":"2","author":"G. J. Holzmann","year":"1999","unstructured":"G. J. Holzmann & A. Puri. A minimized automaton representation of reachable states. Software Tools for Technology Transfer, 2(3), pp. 270\u2013278. Springer-Verlag. 1999.","journal-title":"Software Tools for Technology Transfer"},{"key":"9_CR9","unstructured":"D. E. Knuth. The Art of Computer Programming, Vol. 3: Searching and Sorting. Addison-Wesley. 1973."},{"key":"9_CR10","unstructured":"A. Papoulis. Poisson Process and Shot Noise. Ch. 16 in Probability, Random Variables, and Stochastic Processes, 2nd ed., pp. 554\u2013576. McGraw-Hill. 1984."},{"key":"9_CR11","unstructured":"B. Parreaux. Difference compression in Spin. In Proc. 4th\n                        Spin\n                        Workshop. 1998."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"P. E. Pfeiffer & D. A. Schum. Introduction to Applied Probability. Academic Press. 1973.","DOI":"10.1016\/B978-0-12-553150-4.50008-2"},{"key":"9_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/3-540-60385-9_13","volume-title":"CHARME\u201995: Advanced Research Working Conf. Correct Hardware Design and Verification Methods","author":"U. Stern","year":"1995","unstructured":"U. Stern & D. L. Dill. Improved probabilistic verification by hash compaction. In CHARME\u201995: Advanced Research Working Conf. Correct Hardware Design and Verification Methods, LNCS #987, pp. 206\u2013224. Springer-Verlag. 1995."},{"key":"9_CR14","unstructured":"http:\/\/www.cs.tut.fi\/ohj\/VARG\/TVT\/"},{"key":"9_CR15","unstructured":"W. C. Visser. Memory efficient storage in Spin. In Proc. 2nd\n                        Spin\n                        Workshop, Held Aug 1996, DIMACS Series No. 32, pp. 21\u201335. AMS. 1997."},{"key":"9_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/3-540-56922-7_6","volume-title":"CAV\u201993: Proc. of the 5th Intl. Conf. on Computer-Aided Verification","author":"P. Wolper","year":"1993","unstructured":"P. Wolper & D. Leroy. Reliable hashing without collision detection. In CAV\u201993: Proc. of the 5th Intl. Conf. on Computer-Aided Verification, LNCS #697, pp. 59\u201370. Springer-Verlag. 1993."}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44829-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T21:59:33Z","timestamp":1675893573000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-44829-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401179","9783540448297"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44829-2_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"15 April 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}