English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/131203
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Title

Anti-unification for unranked terms and hedges

AuthorsKutsia, Temur; Levy, Jordi ; Villaret, Mateu
KeywordsHedges
Software clones
Unranked terms
Generalization
Anti-unification
Issue Date2014
PublisherSpringer
CitationJournal of Automated Reasoning 52: 155- 190 (2014)
AbstractWe study anti-unification for unranked terms and hedges that may contain term and hedge variables. The anti-unification problem of two hedges -1 and -2 is concerned with finding their generalization, a hedge q such that both -1 and -2 are instances of q under some substitutions. Hedge variables help to fill in gaps in generalizations, while term variables abstract single (sub)terms with different top function symbols. First, we design a complete and minimal algorithm to compute least general generalizations. Then, we improve the efficiency of the algorithm by restricting possible alternatives permitted in the generalizations. The restrictions are imposed with the help of a rigidity function, which is a parameter in the improved algorithm and selects certain common subsequences from the hedges to be generalized. The obtained rigid anti-unification algorithm is further made more precise by permitting combination of hedge and term variables in generalizations. Finally, we indicate a possible application of the algorithm in software engineering. © 2013 The Author(s).
URIhttp://hdl.handle.net/10261/131203
DOI10.1007/s10817-013-9285-6
Identifiersdoi: 10.1007/s10817-013-9285-6
issn: 0168-7433
Appears in Collections:(IIIA) Artículos
Files in This Item:
File Description SizeFormat 
JAR52(2)_155-90.pdf868,86 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 

Related articles:


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.