Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2018.9
URN: urn:nbn:de:0030-drops-91797
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9179/
Baumgartner, Alexander ; Kutsia, Temur ; Levy, Jordi ; Villaret, Mateu
Term-Graph Anti-Unification
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{baumgartner_et_al:LIPIcs:2018:9179,
author = {Alexander Baumgartner and Temur Kutsia and Jordi Levy and Mateu Villaret},
title = {{Term-Graph Anti-Unification}},
booktitle = {3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-077-4},
ISSN = {1868-8969},
year = {2018},
volume = {108},
editor = {H{\'e}l{\`e}ne Kirchner},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9179},
URN = {urn:nbn:de:0030-drops-91797},
doi = {10.4230/LIPIcs.FSCD.2018.9},
annote = {Keywords: Cyclic term-graps, anti-unification, least general generalization}
}
| Keywords: | Cyclic term-graps, anti-unification, least general generalization | |
| Seminar: | 3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 04.07.2018 |
