{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,22]],"date-time":"2026-03-22T08:24:04Z","timestamp":1774167844248,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,7,17]],"date-time":"2011-07-17T00:00:00Z","timestamp":1310860800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0716460OCI-1032341"],"award-info":[{"award-number":["CNS-0716460OCI-1032341"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000180","name":"U.S. Department of Homeland Security","doi-asserted-by":"publisher","award":["FA8750-10-2-0030"],"award-info":[{"award-number":["FA8750-10-2-0030"]}],"id":[{"id":"10.13039\/100000180","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000105","name":"Office of Cyberinfrastructure","doi-asserted-by":"publisher","award":["CNS-0716460OCI-1032341"],"award-info":[{"award-number":["CNS-0716460OCI-1032341"]}],"id":[{"id":"10.13039\/100000105","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0004061DE-SC0002154"],"award-info":[{"award-number":["DE-SC0004061DE-SC0002154"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,7,17]]},"DOI":"10.1145\/2001420.2001433","type":"proceedings-article","created":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T12:34:54Z","timestamp":1311165294000},"page":"100-110","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":54,"title":["Recovering the toolchain provenance of binary code"],"prefix":"10.1145","author":[{"given":"Nathan","family":"Rosenblum","sequence":"first","affiliation":[{"name":"University of Wisconsin, Madison, WI"}]},{"given":"Barton P.","family":"Miller","sequence":"additional","affiliation":[{"name":"University of Wisconsin, Madison, WI"}]},{"given":"Xiaojin","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of Wisconsin, Madison, WI"}]}],"member":"320","published-online":{"date-parts":[[2011,7,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Network and Distrtributed System Security Symposium (NDSS)","author":"Bayer U.","year":"2009","unstructured":"U. Bayer , P. M. Comparetti , C. Hlauschek , C. Kr\u00fcgel , and E. Kirda . Scalable, behavior-based malware clustering . In Network and Distrtributed System Security Symposium (NDSS) , San Diego, CA , February 2009 . U. Bayer, P. M. Comparetti, C. Hlauschek, C. Kr\u00fcgel, and E. Kirda. Scalable, behavior-based malware clustering. In Network and Distrtributed System Security Symposium (NDSS), San Diego, CA, February 2009."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11790754_8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2005.20"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380250706"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022627411411"},{"key":"e_1_3_2_1_6_1","first-page":"9","author":"Fan R.-E.","year":"2008","unstructured":"R.-E. Fan , K.-W. Chang , C.-J. Hsieh , X.-R. Wang , and C.-J. Lin . LIBLINEAR: A library for large linear classification. Journal of Machine Learning Research , 9 , 2008 . R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X.-R. Wang, and C.-J. Lin. LIBLINEAR: A library for large linear classification. Journal of Machine Learning Research, 9, 2008.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_7_1","volume-title":"Software forensics: Extending authorship analysis techniques to computer programs","author":"Gray A.","year":"1997","unstructured":"A. Gray , P. Sallis , and S. MacDonell . Software forensics: Extending authorship analysis techniques to computer programs . In International Association of Forensic Linguists , Durham, NC , September 1997 . A. Gray, P. Sallis, and S. MacDonell. Software forensics: Extending authorship analysis techniques to computer programs. In International Association of Forensic Linguists, Durham, NC, September 1997."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21606-5"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/stvr.412"},{"issue":"1","key":"e_1_3_2_1_10_1","volume":"1","author":"Karim M.","year":"2005","unstructured":"M. Karim , A. Walenstein , A. Lakhotia , and L. Parida . Malware phylogeny generation using permutations of code. Journal in Computer Virology , 1 ( 1 ), November 2005 . M. Karim, A. Walenstein, A. Lakhotia, and L. Parida. Malware phylogeny generation using permutations of code. Journal in Computer Virology, 1(1), November 2005.","journal-title":"Journal in Computer Virology"},{"key":"e_1_3_2_1_11_1","first-page":"7","author":"Kolter J. Z.","year":"2006","unstructured":"J. Z. Kolter and M. A. Maloof . Learning to detect and classify malicious executables in the wild. Journal of Machine Learning Research , 7 , 2006 . J. Z. Kolter and M. A. Maloof. Learning to detect and classify malicious executables in the wild. Journal of Machine Learning Research, 7, 2006.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_12_1","volume-title":"Authorship analysis: identifying the author of a program. Computers & Security, 16(3)","author":"Krsul I.","year":"1997","unstructured":"I. Krsul and E. H. Spafford . Authorship analysis: identifying the author of a program. Computers & Security, 16(3) , 1997 . I. Krsul and E. H. Spafford. Authorship analysis: identifying the author of a program. Computers & Security, 16(3), 1997."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11663812_11"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_15_1","volume-title":"Uncertainty in Artificial Intelligence","author":"McCallum A.","year":"2003","unstructured":"A. McCallum . Efficiently inducing features of conditional random fields . In Uncertainty in Artificial Intelligence , Acapulco, Mexico , August 2003 . A. McCallum. Efficiently inducing features of conditional random fields. In Uncertainty in Artificial Intelligence, Acapulco, Mexico, August 2003."},{"key":"e_1_3_2_1_16_1","volume-title":"MALLET: A machine learning for language toolkit","author":"McCallum A. K.","year":"2002","unstructured":"A. K. McCallum . MALLET: A machine learning for language toolkit . 2002 . URL http:\/\/www.cs.umass.edu\/mccallum\/mallet. A. K. McCallum. MALLET: A machine learning for language toolkit. 2002. URL http:\/\/www.cs.umass.edu\/mccallum\/mallet."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1882362.1882417"},{"key":"e_1_3_2_1_19_1","volume-title":"ParseAPI: An application program interface for binary parsing","author":"Project Paradyn","year":"2011","unstructured":"Paradyn Project . ParseAPI: An application program interface for binary parsing . 2011 . URL http:\/\/paradyn.org\/html\/parse0.9-features.html. Paradyn Project. ParseAPI: An application program interface for binary parsing. 2011. URL http:\/\/paradyn.org\/html\/parse0.9-features.html."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth436"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1558607.1558653"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70542-0_6"},{"key":"e_1_3_2_1_23_1","volume-title":"Artificial Intelligence (AAAI)","author":"Rosenblum N. E.","year":"2008","unstructured":"N. E. Rosenblum , X. Zhu , B. P. Miller , and K. Hunt . Learning to analyze binary computer code . In Artificial Intelligence (AAAI) , Chicago, IL , July 2008 . N. E. Rosenblum, X. Zhu, B. P. Miller, and K. Hunt. Learning to analyze binary computer code. In Artificial Intelligence (AAAI), Chicago, IL, July 2008."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806672.1806678"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572287"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04342-0_7"},{"key":"e_1_3_2_1_28_1","volume-title":"GRaphical Models in Mallet","author":"Sutton C.","year":"2006","unstructured":"C. Sutton . GRMM : GRaphical Models in Mallet . 2006 . URL http:\/\/mallet.cs.umass.edu\/grmm\/. C. Sutton. GRMM: GRaphical Models in Mallet. 2006. URL http:\/\/mallet.cs.umass.edu\/grmm\/."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/580571.828823"},{"key":"e_1_3_2_1_30_1","volume-title":"Advances in Neural Information Processing Systems (NIPS)","author":"Wainright M. J.","year":"2001","unstructured":"M. J. Wainright , T. Jaakkola , and A. S. Willsky . Tree-base reparameterization for approximate inference in loopy graphs . In Advances in Neural Information Processing Systems (NIPS) , December 2001 . M. J. Wainright, T. Jaakkola, and A. S. Willsky. Tree-base reparameterization for approximate inference in loopy graphs. In Advances in Neural Information Processing Systems (NIPS), December 2001."}],"event":{"name":"ISSTA '11: International Symposium on Software Testing and Analysis","location":"Toronto Ontario Canada","acronym":"ISSTA '11","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 2011 International Symposium on Software Testing and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2001420.2001433","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2001420.2001433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:54Z","timestamp":1750244394000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2001420.2001433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,17]]},"references-count":28,"alternative-id":["10.1145\/2001420.2001433","10.1145\/2001420"],"URL":"https:\/\/doi.org\/10.1145\/2001420.2001433","relation":{},"subject":[],"published":{"date-parts":[[2011,7,17]]},"assertion":[{"value":"2011-07-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}