{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T08:02:51Z","timestamp":1747468971764},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642026515"},{"type":"electronic","value":"9783642026522"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02652-2_6","type":"book-chapter","created":{"date-parts":[[2009,6,25]],"date-time":"2009-06-25T11:43:06Z","timestamp":1245930186000},"page":"12-31","source":"Crossref","is-referenced-by-count":7,"title":["Fast, All-Purpose State Storage"],"prefix":"10.1007","author":[{"given":"Peter C.","family":"Dillinger","sequence":"first","affiliation":[]},{"given":"Panagiotis","family":"Manolios","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"The Spin Model Checker: Primer and Reference Manual","author":"G.J. Holzmann","year":"2003","unstructured":"Holzmann, G.J.: The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, Boston (2003)"},{"key":"6_CR2","first-page":"301","volume-title":"Proc. 15th Int. Conf. on Protocol Specification, Testing, and Verification, INWG\/IFIP","author":"G.J. Holzmann","year":"1995","unstructured":"Holzmann, G.J.: An analysis of bitstate hashing. In: Proc. 15th Int. Conf. on Protocol Specification, Testing, and Verification, INWG\/IFIP, Warsaw, Poland, pp. 301\u2013314. Chapman & Hall, Boca Raton (1995)"},{"issue":"7","key":"6_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Communications of the ACM"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-30494-4_26","volume-title":"Formal Methods in Computer-Aided Design","author":"P.C. Dillinger","year":"2004","unstructured":"Dillinger, P.C., Manolios, P.: Bloom filters in probabilistic verification. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol.\u00a03312, pp. 367\u2013381. Springer, Heidelberg (2004)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Stern, U., Dill, D.L.: A new scheme for memory-efficient probabilistic verification. In: IFIP TC6\/WG6.1 Joint Int\u2019l. Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification, pp. 333\u2013348 (1996)","DOI":"10.1007\/978-0-387-35079-0_21"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/11537328_22","volume-title":"Model Checking Software","author":"P.C. Dillinger","year":"2005","unstructured":"Dillinger, P.C., Manolios, P.: Enhanced probabilistic verification with 3Spin and 3Murphi. In: Godefroid, P. (ed.) SPIN 2005. LNCS, vol.\u00a03639, pp. 272\u2013276. Springer, Heidelberg (2005)"},{"issue":"9","key":"6_CR7","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1109\/TC.1984.1676499","volume":"33","author":"J.G. Cleary","year":"1984","unstructured":"Cleary, J.G.: Compact hash tables using bidirectional linear probing. IEEE Trans. Computers\u00a033(9), 828\u2013834 (1984)","journal-title":"IEEE Trans. Computers"},{"key":"6_CR8","first-page":"823","volume-title":"Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"A. Pagh","year":"2005","unstructured":"Pagh, A., Pagh, R., Rao, S.S.: An optimal bloom filter replacement. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 823\u2013829. SIAM, Philadelphia (2005)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Wolper, P., Leroy, D.: Reliable hashing without collision detection. In: 5th International Conference on Computer Aided Verification, pp. 59\u201370 (1993)","DOI":"10.1007\/3-540-56922-7_6"},{"key":"6_CR10","unstructured":"Holzmann, G.J., Peled, D.: Partial order reduction of the state space. In: First SPIN Workshop, Montr\u00e8al, Quebec (1995)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/11537328_10","volume-title":"Model Checking Software","author":"D. Bosnacki","year":"2005","unstructured":"Bosnacki, D., Holzmann, G.J.: Improving spin\u2019s partial-order reduction for breadth-first search. In: Godefroid, P. (ed.) SPIN 2005. LNCS, vol.\u00a03639, pp. 91\u2013105. Springer, Heidelberg (2005)"},{"key":"6_CR12","first-page":"59","volume-title":"Proceedings of the 10th ACM Symposium on Theory of Computing (STOC)","author":"L. Carter","year":"1978","unstructured":"Carter, L., Floyd, R., Gill, J., Markowsky, G., Wegman, M.: Exact and approximate membership testers. In: Proceedings of the 10th ACM Symposium on Theory of Computing (STOC), pp. 59\u201365. ACM, New York (1978)"},{"key":"6_CR13","first-page":"318","volume-title":"Proceedings of the 39th ACM Symposium on Theory of Computing (STOC)","author":"A. Pagh","year":"2007","unstructured":"Pagh, A., Pagh, R., Ruzic, M.: Linear probing with constant independence. In: Proceedings of the 39th ACM Symposium on Theory of Computing (STOC), New York, NY, USA, pp. 318\u2013327. ACM, New York (2007)"},{"key":"6_CR14","unstructured":"Jenkins, B.: \n                    \n                      http:\/\/burtleburtle.net\/bob\/hash\/index.html\n                    \n                    \n                   (2007)"},{"key":"6_CR15","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L. Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area Web cache sharing protocol. IEEE\/ACM Transactions on Networking\u00a08(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"6_CR17","unstructured":"Dillinger, P.C., Manolios, P.: 3Spin home page, \n                    \n                      http:\/\/3spin.peterd.org\/"},{"issue":"10","key":"6_CR18","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TSE.2007.70724","volume":"33","author":"G.J. Holzmann","year":"2007","unstructured":"Holzmann, G.J., Bosnacki, D.: The design of a multicore extension of the spin model checker. IEEE Trans. Softw. Eng.\u00a033(10), 659\u2013674 (2007)","journal-title":"IEEE Trans. Softw. Eng."}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02652-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T23:55:55Z","timestamp":1552089355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02652-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642026515","9783642026522"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02652-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}