{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:45:10Z","timestamp":1742917510490,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319490939"},{"type":"electronic","value":"9783319490946"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-49094-6_41","type":"book-chapter","created":{"date-parts":[[2016,11,4]],"date-time":"2016-11-04T22:09:49Z","timestamp":1478297389000},"page":"560-567","source":"Crossref","is-referenced-by-count":2,"title":["On the Effectiveness of Vector-Based Approach for Supporting Simultaneous Editing of Software Clones"],"prefix":"10.1007","author":[{"given":"Seiya","family":"Numata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norihiro","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eunjong","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuro","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,6]]},"reference":[{"issue":"1","key":"41_CR1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. CACM 51(1), 117\u2013122 (2008)","journal-title":"CACM"},{"key":"41_CR2","volume-title":"Modern Information Retrieval: The Concepts and Technology behind Search","author":"R Baeza-Yates","year":"2011","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval: The Concepts and Technology behind Search, 2nd edn. (ACM Press Books) Addison-Wesley Professional, Harlow (2011)","edition":"2"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Balazinska, M., Merlo, E., Dagenais, M., Lague, B., Kontogiannis, K.: Measuring clone based reengineering opportunities. In: Proceedings of METRICS 1999, pp. 292\u2013303 (1999)","DOI":"10.1109\/METRIC.1999.809750"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Deissenboeck, F., Heinemann, L., Hummel, B., Wagner, S.: Challenges of the dynamic detection of functionally similar code fragments. In: Proceedings of CSMR 2012, pp. 299\u2013308 (2012)","DOI":"10.1109\/CSMR.2012.38"},{"issue":"6","key":"41_CR5","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1002\/smr.394","volume":"20","author":"Y Higo","year":"2008","unstructured":"Higo, Y., Kusumoto, S., Inoue, K.: A metric-based approach to identifying refactoring opportunities for merging code clones in a java software system. J. Softw. Maintenance Evol. 20(6), 435\u2013461 (2008)","journal-title":"J. Softw. Maintenance Evol."},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of STOC 1998, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Jiang, L., Misherghi, G., Su, Z., Glondu, S.: DECKARD: scalable and accurate tree-based detection of code clones. In: Proceedings of ICSE 2007, pp. 96\u2013105 (2007)","DOI":"10.1109\/ICSE.2007.30"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Jiang, L., Su, Z.: Automatic mining of functionally equivalent code fragments via random testing. In: Proceedings of ISSTA 2009, pp. 81\u201392 (2009)","DOI":"10.1145\/1572272.1572283"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Jiang, L., Su, Z., Chiu, E.: Context-based detection of clone-related bugs. In: Proceedings of ESEC-FSE 2007, pp. 55\u201364 (2007)","DOI":"10.1145\/1287624.1287634"},{"issue":"7","key":"41_CR10","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1109\/TSE.2002.1019480","volume":"28","author":"T Kamiya","year":"2002","unstructured":"Kamiya, T., Kusumoto, S., Inoue, K.: CCFinder: a multilinguistic token-based code clone detection system for large scale source code. IEEE Trans. Softw. Eng. 28(7), 654\u2013670 (2002)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Kim, H., Jung, Y., Kim, S., Yi, K.: MeCC: memory comparison-based clone detector. In: Proceedings of ICSE 2011, pp. 301\u2013310 (2011)","DOI":"10.1145\/1985793.1985835"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Komondoor, R., Horwitz, S.: Using slicing to identify duplication in source code. In: Proceedings of SAS 2001, pp. 40\u201356 (2001)","DOI":"10.1007\/3-540-47764-0_3"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Krinke, J.: Identifying similar code with program dependence graphs. In: Proceedings of WCRE 2001, pp. 301\u2013307 (2001)","DOI":"10.1109\/WCRE.2001.957835"},{"key":"41_CR14","unstructured":"Li, J., Ernst, M.D.: CBCD: Cloned buggy code detector. Technical report UW-CSE-11-05-02, University of Washington Department of Computer Science and Engineering (2011)"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Li, J., Ernst, M.D.: CBCD: cloned buggy code detector. In: Proceedings of ICSE 2012, pp. 310\u2013320 (2012)","DOI":"10.1109\/ICSE.2012.6227183"},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Marcus, A., Maletic, J.I.: Identification of high-level concept clones in source code. In: Proceedings of ASE 2001, pp. 107\u2013114 (2001)","DOI":"10.1109\/ASE.2001.989796"},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"Uramoto, N., Takeda, K.: A method for relating multiple newspaper articles by using graphs, and its application to webcasting. In: Proceedings of ACL 1998, pp. 1307\u20131313 (1998)","DOI":"10.3115\/980432.980782"},{"issue":"10","key":"41_CR18","first-page":"2245","volume":"55","author":"Y Yamanaka","year":"2014","unstructured":"Yamanaka, Y., Choi, E., Yoshida, N., Inoue, K.: A high speed function clone detection based on information retrieval technique. IPSJ J. 55(10), 2245\u20132255 (2014). in Japanese","journal-title":"IPSJ J."},{"key":"41_CR19","doi-asserted-by":"crossref","unstructured":"Yoshida, N., Higo, Y., Kamiya, T., Kusumoto, S., Inoue, K.: On refactoring support based on code clone dependency relation. In: Proceedings of METRICS 2005, pp. 16:1\u201316:10 (2005)","DOI":"10.1109\/METRICS.2005.36"}],"container-title":["Lecture Notes in Computer Science","Product-Focused Software Process Improvement"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49094-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T05:13:21Z","timestamp":1568524401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49094-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319490939","9783319490946"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49094-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}