{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:32:52Z","timestamp":1773192772753,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T00:00:00Z","timestamp":1099180800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,10,31]]},"DOI":"10.1145\/1029894.1029909","type":"proceedings-article","created":{"date-parts":[[2005,1,30]],"date-time":"2005-01-30T12:55:16Z","timestamp":1107089716000},"page":"83-93","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Correlation exploitation in error ranking"],"prefix":"10.1145","author":[{"given":"Ted","family":"Kremenek","sequence":"first","affiliation":[{"name":"Stanford University"}]},{"given":"Ken","family":"Ashcraft","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Junfeng","family":"Yang","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Dawson","family":"Engler","sequence":"additional","affiliation":[{"name":"Stanford University"}]}],"member":"320","published-online":{"date-parts":[[2004,10,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/646482.691588"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604140"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/380921.380932"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(200006)30:7%3C775::AID-SPE309%3E3.0.CO;2-H"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586142"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/502034.502042"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/129837"},{"key":"e_1_3_2_1_8_1","volume-title":"Probabilistic Networks and Expert Systems","author":"Cowell R. G.","year":"1999","unstructured":"R. G. Cowell , A. P. Dawid , S. L. Lauritzen , and D. J. Spiegelhalter . Probabilistic Networks and Expert Systems . Springer , 1999 . R. G. Cowell, A. P. Dawid, S. L. Lauritzen, and D. J. Spiegelhalter. Probabilistic Networks and Expert Systems. Springer, 1999."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512538"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251229.1251230"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/193173.195297"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/52.976940"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/349299.349328"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512558"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512531"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3235-1","volume-title":"Permutation Tests: A Practical Guide to Resampling Methods for Testing Hypotheses","author":"Good P.","year":"2000","unstructured":"P. Good . Permutation Tests: A Practical Guide to Resampling Methods for Testing Hypotheses . Springer , 2000 . P. Good. Permutation Tests: A Practical Guide to Resampling Methods for Testing Hypotheses. Springer, 2000."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/512529.512539"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/581339.581377"},{"key":"e_1_3_2_1_19_1","volume-title":"A technical introduction to PREfix\/Enterprise. Technical report","year":"1998","unstructured":"Intrinsa. A technical introduction to PREfix\/Enterprise. Technical report , Intrinsa Corporation , 1998 . Intrinsa. A technical introduction to PREfix\/Enterprise. Technical report, Intrinsa Corporation, 1998."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760267.1760289"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781148"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007512.1007524"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the 10th USENIX Security Symposium","author":"Shankar U.","year":"2001","unstructured":"U. Shankar , K. Talwar , J. S. Foster , and D. Wagner . Detecting format string vulnerabilities with type qualifiers . In Proceedings of the 10th USENIX Security Symposium , 2001 . U. Shankar, K. Talwar, J. S. Foster, and D. Wagner. Detecting format string vulnerabilities with type qualifiers. In Proceedings of the 10th USENIX Security Symposium, 2001."},{"key":"e_1_3_2_1_24_1","volume-title":"2000 NDSSC","author":"Wagner D.","year":"2000","unstructured":"D. Wagner , J. Foster , E. Brewer , and A. Aiken . A first step towards automated detection of buffer overrun vulnerabilities . In 2000 NDSSC , Feb. 2000 . D. Wagner, J. Foster, E. Brewer, and A. Aiken. A first step towards automated detection of buffer overrun vulnerabilities. In 2000 NDSSC, Feb. 2000."},{"key":"e_1_3_2_1_25_1","first-page":"239","volume-title":"Exploring Artificial Intelligence in the New Millennium","author":"Yedidia J. S.","year":"2003","unstructured":"J. S. Yedidia , W. T. Freeman , and Y. Weiss . Understanding belief propagation and its generalizations . In Exploring Artificial Intelligence in the New Millennium , pages 239 -- 269 . Morgan Kaufmann Publishers Inc ., 2003 . J. S. Yedidia, W. T. Freeman, and Y. Weiss. Understanding belief propagation and its generalizations. In Exploring Artificial Intelligence in the New Millennium, pages 239--269. Morgan Kaufmann Publishers Inc., 2003."}],"event":{"name":"SIGSOFT04\/FSE-12: SIGSOFT 2004 -12th International Symposium on the Foundations of Software Engineering","location":"Newport Beach CA USA","acronym":"SIGSOFT04\/FSE-12","sponsor":["ACM Association for Computing Machinery","SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1029894.1029909","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1029894.1029909","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:31:03Z","timestamp":1750249863000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1029894.1029909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,31]]},"references-count":25,"alternative-id":["10.1145\/1029894.1029909","10.1145\/1029894"],"URL":"https:\/\/doi.org\/10.1145\/1029894.1029909","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1041685.1029909","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2004,10,31]]},"assertion":[{"value":"2004-10-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}