{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:23:00Z","timestamp":1775053380944,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642114854","type":"print"},{"value":"9783642114861","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11486-1_35","type":"book-chapter","created":{"date-parts":[[2010,1,27]],"date-time":"2010-01-27T08:39:51Z","timestamp":1264581591000},"page":"413-423","source":"Crossref","is-referenced-by-count":13,"title":["Anti-unification Algorithms and Their Applications in Program Analysis"],"prefix":"10.1007","author":[{"given":"Peter E.","family":"Bulychev","sequence":"first","affiliation":[]},{"given":"Egor V.","family":"Kostylev","sequence":"additional","affiliation":[]},{"given":"Vladimir A.","family":"Zakharov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a01, pp. 447\u2013533 (2001)","DOI":"10.1016\/B978-044450813-3\/50010-2"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Baxter, I., Yahin, A., Moura, L.M., Sant\u2019Anna, M., Bier, L.: Clone Detection Using Abstract Syntax Trees. In: Proc. of the 14th IEEE International Conference on Software Maintenance, pp. 368\u2013377 (1998)","DOI":"10.1109\/ICSM.1998.738528"},{"issue":"1-3","key":"35_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P. Bille","year":"2005","unstructured":"Bille, P.: A survey on tree distance and related problems. Theoretical Computer Science\u00a0337(1-3), 217\u2013239 (2005)","journal-title":"Theoretical Computer Science"},{"key":"35_CR4","first-page":"18","volume":"9","author":"P. Bulychev","year":"2008","unstructured":"Bulychev, P.: Duplicate code detection using Clone Digger. PythonMagazine\u00a09, 18\u201324 (2008)","journal-title":"PythonMagazine"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Bulychev, P., Minea, M.: An evaluation of duplicate code detection using anti-unification. In: Proc. of the 3rd Int. Workshop on Software Clones, pp. 22\u201327 (2009)","DOI":"10.15514\/SYRCOSE-2008-2-22"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0747-7171(85)80027-4","volume":"1","author":"E. Eder","year":"1985","unstructured":"Eder, E.: Properties of substitutions and unifications. Journal of Symbolic Computations\u00a01, 31\u201346 (1985)","journal-title":"Journal of Symbolic Computations"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Evans, W., Fraser, C., Ma, F.: Clone detection via structural abstraction. In: Proc. of 14th Working Conference on Reverse Engineering, pp. 150\u2013159 (2007)","DOI":"10.1109\/WCRE.2007.15"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Kovac, L.I., Jebelean, T.: An algorithm for automated generation of invariants for loops with conditionals. In: Proc. of the 7th Int. Symp. on Symbolic and Numeric Algorithms for Scientific Computing, pp. 245\u2013250 (2005)","DOI":"10.1109\/SYNASC.2005.19"},{"key":"35_CR9","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of program analysis","author":"F. Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of program analysis, 446 p. Springer, Heidelberg (1999)"},{"key":"35_CR10","unstructured":"Oancea, C.E., So, C., Watt, S.M.: Generalization in Maple. In: Maple Conference, pp. 277\u2013382 (2005)"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/BFb0032046","volume-title":"Automata, Languages and Programming","author":"C. Palamidessi","year":"1990","unstructured":"Palamidessi, C.: Algebraic properties of idempotent substitutions. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 386\u2013399. Springer, Heidelberg (1990)"},{"issue":"1","key":"35_CR12","first-page":"153","volume":"5","author":"G.D. Plotkin","year":"1970","unstructured":"Plotkin, G.D.: A note on inductive generalization. Machine Intelligence\u00a05(1), 153\u2013163 (1970)","journal-title":"Machine Intelligence"},{"issue":"1","key":"35_CR13","first-page":"135","volume":"5","author":"J.C. Reynolds","year":"1970","unstructured":"Reynolds, J.C.: Transformational systems and the algebraic structure of atomic formulas. Machine Intelligence\u00a05(1), 135\u2013151 (1970)","journal-title":"Machine Intelligence"},{"key":"35_CR14","unstructured":"Roy, C.K., Cordy, J.R.: A survey on software clone detection research. Technical Report N 2007-541, School of Computing Queen\u2019s University at Kingston Ontario, Canada"},{"key":"35_CR15","first-page":"465","volume-title":"Proc. of the 1995 Int. Symposium on Logic Programming","author":"M.H. Sorensen","year":"1995","unstructured":"Sorensen, M.H.: Gluck. R. An algorithm of generalization in positive supercompilation. In: Proc. of the 1995 Int. Symposium on Logic Programming, pp. 465\u2013479. MIT Press, Cambridge (1995)"},{"key":"35_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/3-540-45319-9_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Tiwari","year":"2001","unstructured":"Tiwari, A., Rueb, H., Saidi, H., Shankar, N.: A technique for invariant generation. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol.\u00a02031, pp. 113\u2013127. Springer, Heidelberg (2001)"},{"issue":"3","key":"35_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/1113439.1113452","volume":"39","author":"S.M. Watt","year":"2005","unstructured":"Watt, S.M.: Algebraic generalization. ACM SIGSAM Bulletin\u00a039(3), 93\u201394 (2005)","journal-title":"ACM SIGSAM Bulletin"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Wettel, R., Marinescu, R.: Archeology of Code Duplication: Recovering Duplication Chains From Small Duplication Fragments. In: Proc. of the 7th Int. Symb. on Symbolic and Numeric Algorithms for Scientific Computing, pp. 63\u201370 (2005)","DOI":"10.1109\/SYNASC.2005.20"}],"container-title":["Lecture Notes in Computer Science","Perspectives of Systems Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11486-1_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:41:15Z","timestamp":1606185675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11486-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114854","9783642114861"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11486-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}