2026-07-24T02:23:28Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9179 2024-03-06T10:43:33Z ddc:004 open_access

Term-Graph Anti-Unification Baumgartner, Alexander Kutsia, Temur Levy, Jordi Villaret, Mateu Cyclic term-graps anti-unification least general generalization We study anti-unification for possibly cyclic, unranked term-graphs and develop an algorithm, which computes a minimal complete set of generalizations for them. For bisimilar graphs the algorithm computes the join in the lattice generated by a functional bisimulation. These results generalize anti-unification for ranked and unranked terms to the corresponding term-graphs, and solve also anti-unification problems for rational terms and dags. Our results open a way to widen anti-unification based code clone detection techniques from a tree representation to a graph representation of the code. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Alexander Baumgartner and Temur Kutsia and Jordi Levy and Mateu Villaret 2018 Is Part Of LIPIcs, Volume 108, 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSCD.2018.9 urn:nbn:de:0030-drops-91797 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2018.9 eng https://creativecommons.org/licenses/by/3.0/legalcode