DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación
Contribución de congreso (ConferenceOutput)
Term-graph anti-unification
Trabajo presentado en el 3rd International Conference on Formal Structures for Computation and Deduction (FSCD), celebrado en Oxford (Inglaterra), del 9 al 12 de julio de 2018, 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., Supported by the Austrian Science Fund (FWF) under the projects P 28789-N32 and J
3909-N31, by MINECO/FEDER projects TIN2015-71799-C2-1-P (RASO) and TIN2015-66293-R (LoCos), and by UdG project MPCUdG2016/055., Peer reviewed