{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T03:42:04Z","timestamp":1790826124649,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540603856","type":"print"},{"value":"9783540455165","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60385-9_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:24:00Z","timestamp":1330280640000},"page":"206-224","source":"Crossref","is-referenced-by-count":58,"title":["Improved probabilistic verification by hash compaction"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Stern","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David L.","family":"Dill","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1093\/comjnl\/17.2.135","volume":"17","author":"O. Amble","year":"1974","unstructured":"O. Amble and D. E. Knuth. Ordered hash tables. Computer Journal, 17(2):135\u2013142, 1974.","journal-title":"Computer Journal"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"J. R. Burch, E. M. Clarke, K. L. McMillan, and D. L. Dill. Sequential circuit verification using symbolic model checking. In 27th ACM\/IEEE Design Automation Conference, pages 46\u201351, 1990.","DOI":"10.1145\/123186.123223"},{"issue":"2","key":"13_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143\u2013154, 1979.","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR4","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, 1990."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"D. L. Dill, A. J. Drexler, A. J. Hu, and C. H. Yang. Protocol verification as a hardware design aid. In IEEE International Conference on Computer Design: VLSI in Computers and Processors, pages 522\u20135, 1992.","DOI":"10.1109\/ICCD.1992.276232"},{"key":"13_CR6","unstructured":"D. L. Dill, S. Park, and A. G. Nowatzyk. Formal specification of abstract memory models. In Symposium on Research on Integrated Systems, pages 38\u201352, 1993."},{"key":"13_CR7","unstructured":"G. H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley Publishing Company, 2nd edition, 1991."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley Publishing Company, 1988.","DOI":"10.1063\/1.4822863"},{"key":"13_CR9","unstructured":"G. J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, 1991."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"A. J. Hu, G. York, and D. L. Dill. New techniques for efficient verification with implicitly conjoined BDDs. In 31st Design Automation Conference, pages 276\u201382, 1994.","DOI":"10.1145\/196244.196377"},{"key":"13_CR11","unstructured":"IEEE Std 1596\u20131992, IEEE Standard for Scalable Coherent Interface (SCI)."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"C. N. Ip and D. L. Dill. Efficient verification of symmetric concurrent systems. In IEEE International Conference on Computer Design: VLSI in Computers and Processors, pages 230\u2013234, 1993.","DOI":"10.1109\/ICCD.1993.393375"},{"key":"13_CR13","unstructured":"D. E. Knuth. The Art of Computer Programming, volume 3. Addison-Wesley Publishing Company, 1973."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"U. Stern and D. L. Dill. Automatic verification of the SCI cache coherence protocol. In IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, 1995.","DOI":"10.1007\/3-540-60385-9_2"},{"key":"13_CR15","unstructured":"P. Wolper and D. Leroy. Reliable hashing without collision detection. Unpublished revised version of [16]."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"P. Wolper and D. Leroy. Reliable hashing without collision detection. In Computer Aided Verification. 5th International Conference, pages 59\u201370, 1993.","DOI":"10.1007\/3-540-56922-7_6"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"L. Yang, D. Gao, J. Mostoufi, R. Joshi, and P. Loewenstein. System design methodology of UltraSPARCTM-I. In 32nd Design Automation Conference, pages 7\u201312, 1995.","DOI":"10.1145\/217474.217481"}],"container-title":["Lecture Notes in Computer Science","Correct Hardware Design and Verification Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60385-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:46:52Z","timestamp":1640944012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60385-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603856","9783540455165"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-60385-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}