{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T22:16:47Z","timestamp":1774045007995,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540237389","type":"print"},{"value":"9783540304944","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30494-4_26","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T18:42:14Z","timestamp":1277836934000},"page":"367-381","source":"Crossref","is-referenced-by-count":45,"title":["Bloom Filters in Probabilistic Verification"],"prefix":"10.1007","author":[{"given":"Peter C.","family":"Dillinger","sequence":"first","affiliation":[]},{"given":"Panagiotis","family":"Manolios","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"26_CR1","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":"26_CR2","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of Bloom filters: A survey. In: Proc. of the 40th Annual Allerton Conference on Communication, Control, and Computing, pp. 636\u2013646 (2002)"},{"key":"26_CR3","first-page":"87","volume-title":"Computer Hardware Description Languages and their Applications","author":"C.N. Ip","year":"1993","unstructured":"Ip, C.N., Dill, D.L.: Better verification through symmetry. In: Computer Hardware Description Languages and their Applications, Ottawa, Canada, pp. 87\u2013100. Elsevier Science Publishers B.V, Amsterdam (1993)"},{"key":"26_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms. McGraw-Hill Higher Education, New York (2001)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Dillinger, P.C., Manolios, P.: Fast and accurate bitstate verification for SPIN. In: 11th SPIN Workshop, Barcelona, Spain (April 2004)","DOI":"10.1007\/978-3-540-24732-6_5"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/3-540-56922-7_37","volume-title":"Computer Aided Verification","author":"E.M. Clarke","year":"1993","unstructured":"Clarke, E.M., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 450\u2013461. Springer, Heidelberg (1993)"},{"issue":"1\/2","key":"26_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"F.A. Emerson","year":"1996","unstructured":"Emerson, F.A., Sistla, A.P.: Symmetry and model checking. Formal Methods in System Design: An International Journal\u00a09(1\/2), 105\u2013131 (1996)","journal-title":"Formal Methods in System Design: An International Journal"},{"issue":"3","key":"26_CR8","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":"26_CR9","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Wolper, P.: A partial approach to model checking. In: Logic in Computer Science, pp. 406\u2013415 (1991)","DOI":"10.1109\/LICS.1991.151664"},{"key":"26_CR10","volume-title":"Handbook of Algorithms and Data Structures","author":"G.H. Gonnet","year":"1984","unstructured":"Gonnet, G.H.: Handbook of Algorithms and Data Structures. Addison-Wesley, Reading (1984)"},{"key":"26_CR11","unstructured":"Holzmann, G., Peled, D.: Partial order reduction of the state space. In: First SPIN Workshop, Montr\u2018eal, Quebec (1995)"},{"key":"26_CR12","volume-title":"Design and Validation of Computer Protocols","author":"G.J. Holzmann","year":"1991","unstructured":"Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs (1991)"},{"key":"26_CR13","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 and Hall, Boca Raton (1995)"},{"key":"26_CR14","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":"26_CR15","volume-title":"The Art of Computer Programming, volume 3: Sorting and Searching","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, Sorting and Searching, 2nd edn., vol.\u00a03. Addison Wesley Longman Publishing Co., Inc, Amsterdam (1997)","edition":"2"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: Compressed Bloom filters. In: Proc. of the 20th Annual ACM Symposium on Principles of Distributed Computing, IEEE\/ACM Trans. on Net., pp. 144\u2013150 (2001)","DOI":"10.1145\/383962.384004"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Penna, G., Intrigila, B., Tronci, E., Zilli, M.: Exploiting transition locality in the disk based Murphi verifier. In: 4th International Conference on Formal Methods in Computer Aided Verification, pp. 202\u2013219 (2002)","DOI":"10.1007\/3-540-36126-X_13"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/3-540-60385-9_13","volume-title":"Correct Hardware Design and Verification Methods","author":"U. Stern","year":"1995","unstructured":"Stern, U., Dill, D.L.: Improved probabilistic verification by hash compaction. In: Camurati, P.E., Eveking, H. (eds.) CHARME 1995. LNCS, vol.\u00a0987, pp. 206\u2013224. Springer, Heidelberg (1995)"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Stern, U., Dill, D.L.: A new scheme for memory-efficient probabilistic verification. In: IFIP TC6\/WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols, and Protocol Specification, Testing, and Verification, pp. 333\u2013348, Kaiserslautern Germany, October 8-11 (1996)","DOI":"10.1007\/978-0-387-35079-0_21"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Visser, W., Havelund, K., Brat, G., Park, S.: Model checking programs. In: International Conference on Automated Software Engineering (September 2000)","DOI":"10.1109\/ASE.2000.873645"},{"key":"26_CR21","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":"26_CR22","unstructured":"Wolper, P., Stern, U., Leroy, D., Dill, D.: Reliable probabilistic verification using hash compaction, Unpublished"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-48153-2_6","volume-title":"Correct Hardware Design and Verification Methods","author":"Y. Yu","year":"1999","unstructured":"Yu, Y., Manolios, P., Lamport, L.: Model checking TLA+ specifications. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol.\u00a01703, pp. 54\u201366. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods in Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30494-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T09:56:47Z","timestamp":1740218207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30494-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540237389","9783540304944"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30494-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}