{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:13:37Z","timestamp":1763468017180,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,5,21]],"date-time":"2011-05-21T00:00:00Z","timestamp":1305936000000},"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":[[2011,5,21]]},"DOI":"10.1145\/1985793.1985835","type":"proceedings-article","created":{"date-parts":[[2011,5,24]],"date-time":"2011-05-24T13:04:30Z","timestamp":1306242270000},"page":"301-310","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":81,"title":["MeCC"],"prefix":"10.1145","author":[{"given":"Heejung","family":"Kim","sequence":"first","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yungbum","family":"Jung","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunghun","family":"Kim","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwankeun","family":"Yi","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,5,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2007.70725"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781153"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375615"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1882094.1882109"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.90"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_11"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09526-8_20"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368132"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869459.1869475"},{"key":"e_1_3_2_1_11_1","volume-title":"SEA","author":"Higo Y.","year":"2004","unstructured":"Y. Higo , T. Kamiya , S. Kusumoto , K. Inoue , and K. Words . Aries: Refactoring support environment based on code clone analysis . In SEA , 2004 . Y. Higo, T. Kamiya, S. Kusumoto, K. Inoue, and K. Words. Aries: Refactoring support environment based on code clone analysis. In SEA, 2004."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.30"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572283"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287634"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2009.5070547"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11547662_15"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375634.1375653"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2002.1019480"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095430.1081737"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1181775.1181781"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/647170.718283"},{"key":"e_1_3_2_1_22_1","first-page":"2008","author":"Kuhn H. W.","year":"1958","unstructured":"H. W. Kuhn . The hungarian method for the assignment problem. In 50 Years of Integer Programming 1958 -- 2008 , 2009. H. W. Kuhn. The hungarian method for the assignment problem. In 50 Years of Integer Programming 1958--2008, 2009.","journal-title":"Years of Integer Programming"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.28"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150522"},{"key":"e_1_3_2_1_25_1","first-page":"17","author":"Milner R.","year":"1978","unstructured":"R. Milner . A theory of type polymorphism in programming. Journal of Computer and System Sciences , 17 , 1978 . R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390630.1390643"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.37"},{"key":"e_1_3_2_1_28_1","first-page":"8","author":"Prechelt L.","year":"2001","unstructured":"L. Prechelt , G. Malpohl , and M. Philippsen . Finding plagiarisms among a set of programs with jplag. Journal of Universal Computer Science , 8 , 2001 . L. Prechelt, G. Malpohl, and M. Philippsen. Finding plagiarisms among a set of programs with jplag. Journal of Universal Computer Science, 8, 2001.","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_3_2_1_29_1","volume-title":"SCHOOL OF COMPUTING TR 2007-541","author":"Roy C. K.","year":"2007","unstructured":"C. K. Roy and J. R. Cordy . A survey on software clone detection research . SCHOOL OF COMPUTING TR 2007-541 , QUEEN'S UNIVERSITY, 115, 2007 . C. K. Roy and J. R. Cordy. A survey on software clone detection research. SCHOOL OF COMPUTING TR 2007-541, QUEEN'S UNIVERSITY, 115, 2007."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2008.41"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2009.02.007"},{"key":"e_1_3_2_1_32_1","volume-title":"Computer Science and Statistics: Proc. Symp. on the Interface","author":"Baker B. S.","year":"1992","unstructured":"B. S. Baker . A program for identifying duplicated code . In Computer Science and Statistics: Proc. Symp. on the Interface , 1992 . B. S.Baker. A program for identifying duplicated code. In Computer Science and Statistics: Proc. Symp. on the Interface, 1992."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872770"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1595696.1595725"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081728"}],"event":{"name":"ICSE11: International Conference on Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"],"location":"Waikiki, Honolulu HI USA","acronym":"ICSE11"},"container-title":["Proceedings of the 33rd International Conference on Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1985793.1985835","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1985793.1985835","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:30Z","timestamp":1750244790000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1985793.1985835"}},"subtitle":["memory comparison-based clone detector"],"short-title":[],"issued":{"date-parts":[[2011,5,21]]},"references-count":35,"alternative-id":["10.1145\/1985793.1985835","10.1145\/1985793"],"URL":"https:\/\/doi.org\/10.1145\/1985793.1985835","relation":{},"subject":[],"published":{"date-parts":[[2011,5,21]]},"assertion":[{"value":"2011-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}