{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T15:45:21Z","timestamp":1778600721207,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,8,25]],"date-time":"2016-08-25T00:00:00Z","timestamp":1472083200000},"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":[[2016,8,25]]},"DOI":"10.1145\/2970276.2970315","type":"proceedings-article","created":{"date-parts":[[2016,8,26]],"date-time":"2016-08-26T12:40:09Z","timestamp":1472215209000},"page":"660-671","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":50,"title":["Move-optimized source code tree differencing"],"prefix":"10.1145","author":[{"given":"Georg","family":"Dotzler","sequence":"first","affiliation":[{"name":"University of Erlangen-Nuremberg, Germany"}]},{"given":"Michael","family":"Philippsen","sequence":"additional","affiliation":[{"name":"University of Erlangen-Nuremberg, Germany"}]}],"member":"320","published-online":{"date-parts":[[2016,8,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"GumTreeDiff 2016. https:\/\/github.com\/GumTreeDiff\/.  GumTreeDiff 2016. https:\/\/github.com\/GumTreeDiff\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Jenkins 2016. https:\/\/github.com\/jenkinsci\/jenkins.  Jenkins 2016. https:\/\/github.com\/jenkinsci\/jenkins."},{"key":"e_1_3_2_1_3_1","unstructured":"JSync 2016. https:\/\/sites.google.com\/site\/ nguyenanhhoan\/JSync4Public.zip.  JSync 2016. https:\/\/sites.google.com\/site\/ nguyenanhhoan\/JSync4Public.zip."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E93.D.208"},{"key":"e_1_3_2_1_5_1","first-page":"11","volume-title":"CASCON\u201905: Conf. Centre for Advanced Studies on Collaborative Research","author":"Al-Ekram R.","year":"2005","unstructured":"R. Al-Ekram , A. Adma , and O. Baysal . diffX: An Algorithm to Detect Changes in Multi-version XML Documents . In CASCON\u201905: Conf. Centre for Advanced Studies on Collaborative Research , pages 1\u2013 11 , Toranto, Canada , Oct. 2005 . R. Al-Ekram, A. Adma, and O. Baysal. diffX: An Algorithm to Detect Changes in Multi-version XML Documents. In CASCON\u201905: Conf. Centre for Advanced Studies on Collaborative Research, pages 1\u201311, Toranto, Canada, Oct. 2005."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025115.1025202"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2013.34"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/829519.830817"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.030"},{"key":"e_1_3_2_1_10_1","series-title":"Lecture Notes in Computer Science","first-page":"111","volume-title":"Database and XML Technologies","author":"Boobna U.","unstructured":"U. Boobna and M. de Rougemont . Correctors for XML Data . In Database and XML Technologies , volume 3186 of Lecture Notes in Computer Science , pages 97\u2013 111 . U. Boobna and M. de Rougemont. Correctors for XML Data. In Database and XML Technologies, volume 3186 of Lecture Notes in Computer Science, pages 97\u2013111."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2009.26"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233366"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.878941"},{"key":"e_1_3_2_1_14_1","volume-title":"Statistical Power Analysis for the Behavioral Sciences","author":"Cohen J.","year":"1988","unstructured":"J. Cohen . Statistical Power Analysis for the Behavioral Sciences . Lawrence Erlbaum Associates, Inc. , Hillsdale, NJ , 2 nd edition, 1988 . J. Cohen. Statistical Power Analysis for the Behavioral Sciences. Lawrence Erlbaum Associates, Inc., Hillsdale, NJ, 2nd edition, 1988.","edition":"2"},{"key":"e_1_3_2_1_15_1","volume-title":"Mathematical Methods of Statistics","author":"Cram\u00e9r H.","year":"1946","unstructured":"H. Cram\u00e9r . Mathematical Methods of Statistics . Princeton University Press , Princeton, NJ , 1946 . H. Cram\u00e9r. Mathematical Methods of Statistics. Princeton University Press, Princeton, NJ, 1946."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644015.1644017"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859093"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2642982"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2007.70731"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCRE.2008.44"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2015.7081845"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"e_1_3_2_1_23_1","first-page":"102","volume-title":"Unrooted Ordered Trees. In ESA\u201998: Europ. Symp. Alg.","author":"Klein P. N.","year":"1998","unstructured":"P. N. Klein . Computing the Edit-Distance between Unrooted Ordered Trees. In ESA\u201998: Europ. Symp. Alg. , pages 91\u2013 102 , Venice, Italy , Aug. 1998 . P. N. Klein. Computing the Edit-Distance between Unrooted Ordered Trees. In ESA\u201998: Europ. Symp. Alg., pages 91\u2013102, Venice, Italy, Aug. 1998."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11575832_13"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_2_1_26_1","volume-title":"Semantic Slicing of Software Version Histories. In ASE\u201915: Intl. Conf. Automated Softw. Eng.","author":"Li Y.","year":"2015","unstructured":"Y. Li , J. Rubin , and M. Chechik . Semantic Slicing of Software Version Histories. In ASE\u201915: Intl. Conf. Automated Softw. Eng. , Lincoln, NE , Nov. 2015 . Y. Li, J. Rubin, and M. Chechik. Semantic Slicing of Software Version Histories. In ASE\u201915: Intl. Conf. Automated Softw. Eng., Lincoln, NE, Nov. 2015."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00192-X"},{"key":"e_1_3_2_1_28_1","first-page":"402","volume-title":"ICSE\u201915: Intl. Conf. Softw. Eng. -","volume":"1","author":"Meng N.","year":"2015","unstructured":"N. Meng , L. Hua , M. Kim , and K. S. McKinley . Does Automated Refactoring Obviate Systematic Editing? In ICSE\u201915: Intl. Conf. Softw. Eng. - Volume 1 , pages 392\u2013 402 , Florence, Italy , May 2015 . N. Meng, L. Hua, M. Kim, and K. S. McKinley. Does Automated Refactoring Obviate Systematic Editing? In ICSE\u201915: Intl. Conf. Softw. Eng. - Volume 1, pages 392\u2013402, Florence, Italy, May 2015."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486855"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380151102"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840446"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2011.90"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095692"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786440009463897"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018431.1021403"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368091"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00450-010-0140-2"},{"key":"e_1_3_2_1_38_1","first-page":"98","volume-title":"Edit Distance with Move Operations. In CPM\u201902: Symp. on Combinatorial Pattern Matching","author":"Shapira D.","year":"2002","unstructured":"D. Shapira and J. A. Storer . Edit Distance with Move Operations. In CPM\u201902: Symp. on Combinatorial Pattern Matching , pages 85\u2013 98 , Fukuoka, Japan , July 2002 . D. Shapira and J. A. Storer. Edit Distance with Move Operations. In CPM\u201902: Symp. on Combinatorial Pattern Matching, pages 85\u201398, Fukuoka, Japan, July 2002."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/322139.322143"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/APSEC.2010.46"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1101908.1101919"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218082"}],"event":{"name":"ASE'16: ACM\/IEEE International Conference on Automated Software Engineering","location":"Singapore Singapore","acronym":"ASE'16","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","SIGSOFT ACM Special Interest Group on Software Engineering","IEEE-CS Computer Society"]},"container-title":["Proceedings of the 31st IEEE\/ACM International Conference on Automated Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2970276.2970315","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2970276.2970315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:50:00Z","timestamp":1750218600000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2970276.2970315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,25]]},"references-count":42,"alternative-id":["10.1145\/2970276.2970315","10.1145\/2970276"],"URL":"https:\/\/doi.org\/10.1145\/2970276.2970315","relation":{},"subject":[],"published":{"date-parts":[[2016,8,25]]},"assertion":[{"value":"2016-08-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}