{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T05:13:58Z","timestamp":1737695638656,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540772255"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77226-2_48","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"467-476","source":"Crossref","is-referenced-by-count":2,"title":["Hierarchical Program Representation for Program Element Matching"],"prefix":"10.1007","author":[{"given":"Fernando","family":"Berzal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan-Carlos","family":"Cubero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A\u00edda","family":"Jim\u00e9nez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Kim, M., Notkin, D.: Program element matching for multi-version program analyses. In: MSR 2006. Proceedings of the 2006 International Workshop on Mining Software Repositories, pp. 58\u201364 (2006)","DOI":"10.1145\/1137983.1137999"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Raghavan, S., Rohana, R., Leon, D., Podgurski, A., Augustine, V.: Dex: A semantic-graph differencing tool for studying changes in large code bases. In: ICSM 2004, pp. 188\u2013197 (2004)","DOI":"10.1109\/ICSM.2004.1357803"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Tonella, P.: Formal concept analysis in software engineering. In: ICSE 2004, pp. 743\u2013744 (2004)","DOI":"10.1109\/ICSE.2004.1317515"},{"issue":"5","key":"48_CR4","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"J.W. Hunt","year":"1977","unstructured":"Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Communications of the ACM\u00a020(5), 350\u2013353 (1977)","journal-title":"Communications of the ACM"},{"issue":"4","key":"48_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/357401.357404","volume":"2","author":"W.F. Tichy","year":"1984","unstructured":"Tichy, W.F.: The string-to-string correction problem with block moves. ACM Trans. Comput. Syst.\u00a02(4), 309\u2013321 (1984)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"7","key":"48_CR6","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1002\/spe.4380210706","volume":"21","author":"W. Yang","year":"1991","unstructured":"Yang, W.: Identifying syntactic differences between two programs. Software \u2013 Practice & Experience\u00a021(7), 739\u2013755 (1991)","journal-title":"Software \u2013 Practice & Experience"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Hunt, J.J., Tichy, W.F.: Extensible language-aware merging. In: ICSM 2002, pp. 511\u2013520 (2002)","DOI":"10.1109\/ICSM.2002.1167812"},{"key":"48_CR8","doi-asserted-by":"crossref","unstructured":"Neamtiu, I., Foster, J.S., Hicks, M.: Understanding source code evolution using abstract syntax tree matching. In: MSR 2005. Proceedings of the 2005 International Workshop on Mining Software Repositories, pp. 282\u2013290 (2005)","DOI":"10.1145\/1083142.1083143"},{"key":"48_CR9","unstructured":"Laski, J., Szermer, W.: Identification of program modifications and its applications insoftware maintenance. In: ICSM 1992, pp. 1\u20135 (1992)"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"Apiwattanapong, T., Orso, A., Harrold, M.J.: A differencing algorithm for object-oriented programs. In: ASE 2004, pp. 2\u201313 (2004)","DOI":"10.1109\/ASE.2004.1342719"},{"key":"48_CR11","unstructured":"Wang, Z., Pierce, K., McFarling, S.: Bmat \u2013 a binary matching tools for stale profile propagation. Journal of Instruction-Level Parallelism\u00a02 (2000)"},{"issue":"3","key":"48_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/24039.24041","volume":"9","author":"J. Ferrante","year":"1987","unstructured":"Ferrante, J., Ottenstein, K.J., Warren, J.D.: The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst.\u00a09(3), 319\u2013349 (1987)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"48_CR13","volume-title":"Advanced Compiler Design and Implementation","author":"S. Muchnick","year":"1997","unstructured":"Muchnick, S.: Advanced Compiler Design and Implementation. Morgan Kaufmann, San Francisco (1997)"},{"key":"48_CR14","volume-title":"Optimizing Compilers for Modern Architectures: A Dependence-based Approach","author":"R. Allen","year":"2001","unstructured":"Allen, R., Kennedy, K.: Optimizing Compilers for Modern Architectures: A Dependence-based Approach. Morgan Kaufmann, San Francisco (2001)"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Horwitz, S.: Identifying the semantic and textual differences between two versions of a program. In: PLDI 1990, pp. 234\u2013245 (1990)","DOI":"10.1145\/93542.93574"},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"Krinke, J.: Identifying similar code with program dependence graphs. In: WCRE 2001, pp. 301\u2013309 (2001)","DOI":"10.1109\/WCRE.2001.957835"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Jackson, D., Ladd, D.A.: Semantic diff: A tool for summarizing the effects of modifications. In: ICSM 1994, pp. 243\u2013252 (1994)","DOI":"10.1109\/ICSM.1994.336770"},{"key":"48_CR18","volume-title":"The Sciences of the Artificial","author":"H.A. Simon","year":"1996","unstructured":"Simon, H.A.: The Sciences of the Artificial, 3rd edn. The MIT Press, Cambridge (1996)","edition":"3"},{"key":"48_CR19","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A.V. Aho","year":"2006","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison-Wesley, Reading (2006)","edition":"2"},{"issue":"5","key":"48_CR20","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/42411.42414","volume":"31","author":"D. Harel","year":"1988","unstructured":"Harel, D.: On visual formalisms. Communications of the ACM\u00a031(5), 514\u2013530 (1988)","journal-title":"Communications of the ACM"},{"issue":"1-2","key":"48_CR21","first-page":"33","volume":"66","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundamenta Informaticae\u00a066(1-2), 33\u201352 (2005)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning - IDEAL 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77226-2_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T08:17:41Z","timestamp":1737620261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77226-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772255"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77226-2_48","relation":{},"subject":[]}}