article

Anti-unification for Unranked Terms and Hedges

Authors:

Mateu VillaretAuthors Info & Claims

Journal of Automated Reasoning, Volume 52, Issue 2

Pages 155 - 190

https://doi.org/10.1007/s10817-013-9285-6

Published: 01 February 2014 Publication History

Abstract

We study anti-unification for unranked terms and hedges that may contain term and hedge variables. The anti-unification problem of two hedges ${\tilde{s}}_1$ and ${\tilde{s}}_2$ is concerned with finding their generalization, a hedge ${\tilde{q}}$ such that both ${\tilde{s}}_1$ and ${\tilde{s}}_2$ are instances of ${\tilde{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.

References

[1]

Aït-Kaci, H., Sasaki, Y.: An axiomatic approach to feature term generalization. In: Raedt, L.D., Flach, P.A. (eds.) ECML. Lecture Notes in Computer Science, vol. 2167, pp. 1---12. Springer, Heidelberg (2001)

[2]

Alpuente, M., Escobar, S., Meseguer, J., Ojeda, P.: A modular equational generalization algorithm. In: Hanus, M. (ed.) LOPSTR. Lecture Notes in Computer Science, vol. 5438, pp. 24---39. Springer, Heidelberg (2008)

[3]

Alpuente, M., Escobar, S., Meseguer, J., Ojeda, P.: Order-sorted generalization. Electr. Notes Theor. Comput. Sci. 246, 27---38 (2009)

Digital Library

[4]

Armengol, E., Plaza, E.: Bottom-up induction of feature terms. Mach. Learn. 41(3), 259---294 (2000)

[5]

Baader, F.: Unification, weak unification, upper bound, lower bound, and generalization problems. In: Book, R.V. (ed.) RTA. Lecture Notes in Computer Science, vol. 488, pp. 86---97. Springer, Heidelberg (1991)

[6]

Baxter, I.D., Yahin, A., de Moura, L.M., Sant'Anna, M., Bier, L.: Clone detection using abstract syntax trees. In: ICSM, pp. 368---377 (1998)

Digital Library

[7]

Biere, A.: Normalisation, unification and generalisation in free monoids. Master's thesis, University of Karlsruhe (in German, 1993)

[8]

Bulychev, P., Minea, M.: An evaluation of duplicate code detection using anti-unification. In: Proc. 3rd International Workshop on Software Clones (2009)

[9]

Bulychev, P.E., Kostylev, E.V., Zakharov, V.A.: Anti-unification algorithms and their applications in program analysis. In: Pnueli, A., Virbitskaite, I., Voronkov, A. (eds.) Ershov Memorial Conference. Lecture Notes in Computer Science, vol. 5947, pp. 413---423. Springer, Heidelberg (2009)

[10]

Burghardt, J.: E-generalization using grammars. Artif. Intell. 165(1), 1---35 (2005)

Digital Library

[11]

Cicekli, I., Cicekli, N.K.: Generalizing predicates with string arguments. Appl. Intell. 25(1):23---36 (2006)

Digital Library

[12]

Cirstea, H., Kirchner, C., Kopetz, R., Moreau, P.E.: Anti-patterns for rule-based languages. J. Symb. Comput. 45(5), 523---550 (2010)

Digital Library

[13]

Delcher, A.L., Kasif, S.: Efficient parallel term matching and anti-unification. J. Autom. Reasoning 9(3), 391---406 (1992)

Digital Library

[14]

Evans, W.S., Fraser, C.W., Ma, F.: Clone detection via structural abstraction. Softw. Qual. J. 17(4), 309---330 (2009)

Digital Library

[15]

Gusfield, D.: Algorithms on Strings, Trees, and Sequences--Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)

[16]

Huet, G.: Résolution d'équations dans des langages d'ordre 1,2,...,¿. PhD thesis, Université Paris VII (1976)

[17]

Kitzelmann, E., Schmid, U.: Inductive synthesis of functional programs: an explanation based generalization approach. J. Mach. Learn. Res. 7, 429---454 (2006)

Digital Library

[18]

Koschke, R., Falke, R., Frenzel, P.: Clone detection using abstract syntax suffix trees. In: WCRE, pp. 253---262. IEEE Computer Society (2006)

[19]

Krumnack, U., Schwering, A., Gust, H., Kühnberger, K.U.: Restricted higher-order anti-unification for analogy making. In: Orgun, M.A., Thornton, J. (eds.) Australian Conference on Artificial Intelligence. Lecture Notes in Computer Science, vol. 4830, pp. 273---282. Springer, Heidelberg (2007)

[20]

Kutsia, T.: Solving equations with sequence variables and sequence functions. J. Symb. Comput. 42(3), 352---388 (2007)

Digital Library

[21]

Kutsia, T.: Flat matching. J. Symb. Comput. 43(12), 858---873 (2008)

[22]

Kutsia, T., Marin, M.: Matching with regular constraints. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR. Lecture Notes in Computer Science, vol. 3835, pp. 215---229. Springer, Heidelberg (2005)

[23]

Kutsia, T., Marin, M.: Order-sorted unification with regular expression sorts. In: Lynch, C. (ed.) RTA, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPIcs, vol. 6, pp. 193---208 (2010)

[24]

Kutsia, T., Levy, J., Villaret, M.: Sequence unification through currying. In: Baader, F. (ed.) RTA. Lecture Notes in Computer Science, vol. 4533, pp. 288---302. Springer, Heidelberg (2007)

[25]

Kutsia, T., Levy, J., Villaret, M.: On the relation between context and sequence unification. J. Symb. Comput. 45(1), 74---95 (2010)

Digital Library

[26]

Kutsia, T., Levy, J., Villaret, M.: Anti-unification for unranked terms and hedges. In: Schmidt-Schauß, M. (ed.) RTA. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPIcs, vol. 10, pp. 219---234 (2011)

[27]

Li, H., Thompson, S.J.: Similar code detection and elimination for erlang programs. In: Carro, M., Peña, R. (eds.) PADL. Lecture Notes in Computer Science, vol. 5937, pp. 104---118. Springer, Heidelberg (2010)

[28]

Lu, J., Mylopoulos, J., Harao, M., Hagiya, M.: Higher order generalization and its application in program verification. Ann. Math. Artif. Intell. 28(1---4), 107---126 (2000)

[29]

Pfenning, F.: Unification and anti-unification in the calculus of constructions. In: LICS, pp. 74---85. IEEE Computer Society (1991)

[30]

Plaza, E.: Cases as terms: a feature term approach to the structured representation of cases. In: Veloso, M.M., Aamodt, A. (eds.) ICCBR. Lecture Notes in Computer Science, vol. 1010, pp. 265---276. Springer, Heidelberg (1995)

[31]

Plotkin, G.D.: A note on inductive generalization. Mach. Intell. 5(1), 153---163 (1970)

[32]

Reynolds, J.C.: Transformational systems and the algebraic structure of atomic formulas. Mach. Intell. 5(1), 135---151 (1970)

[33]

Roy, C.K., Cordy, J.R.: A Survey of Software Clone Detection Research. Tech. rep., School of Computing, Queen's University at Kingston, ON, Canada (2007)

[34]

Roy, C.K., Cordy, J.R., Koschke, R.: Comparison and evaluation of code clone detection techniques and tools: a qualitative approach. Sci. Comput. Program 74(7), 470---495 (2009)

Digital Library

[35]

Schmid, U.: Inductive synthesis of functional programs, universal planning, folding of finite programs and schema abstraction by analogical reasoning. In: Lecture Notes in Computer Science, vol. 2654. Springer, Heidelberg (2003)

[36]

Wahler, V., Seipel, D., von Gudenberg, J.W., Fischer, G.: Clone detection in source code by frequent itemset techniques. In: SCAM, pp. 128---135. IEEE Computer Society Press, Los Alamitos (2004)

[37]

Yamamoto, A., Ito, K., Ishino, A., Arimura, H.: Modelling semi-structured documents with hedges for deduction and induction. In: Rouveirol, C., Sebag, M. (eds.) ILP. Lecture Notes in Computer Science, vol. 2157, pp. 240---247. Springer, Heidelberg (2001)

[38]

Yang, W.: Identifying syntactic differences between two programs. Softw. Pract. Exper. 21(7), 739---755 (1991)

Digital Library

Cited By

Cerna DBuran M(2024)One or Nothing: Anti-unification over the Simply-Typed Lambda CalculusACM Transactions on Computational Logic10.1145/365479825:3(1-12)Online publication date: 28-Mar-2024
https://dl.acm.org/doi/10.1145/3654798
Cerna DKutsia TElkind E(2023)Anti-unification and generalizationProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/736(6563-6573)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/736
Winter ENowack VBowes DCounsell SHall THaraldsson SWoodward JKirbas SWindels EMcBello OAtakishiyev AKells KPagano MRoychoudhury ACadar CKim M(2022)Towards developer-centered automatic program repair: findings from BloombergProceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3540250.3558953(1578-1588)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3540250.3558953
Show More Cited By

Recommendations

Idempotent Anti-unification

In this article, we address two problems related to idempotent anti-unification. First, we show that there exists an anti-unification problem with a single idempotent symbol that has an infinite minimal complete set of generalizations. It means that ...
Unranked second-order anti-unification

In this work we study anti-unification for unranked terms and hedges, permitting context and hedge variables. Hedges are sequences of unranked terms. The anti-unification problem of two hedges s and q is concerned with finding their generalization, a ...
Unranked Second-Order Anti-Unification
WoLLIC 2014: Proceedings of the 21st International Workshop on Logic, Language, Information, and Computation - Volume 8652

In this work we study anti-unification for unranked hedges, permitting context and hedge variables. Hedges are sequences of unranked terms. The anti-unification problem of two hedges <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$\tilde{s} $</...

Comments

Information & Contributors

Information

Published In

cover image Journal of Automated Reasoning

Journal of Automated Reasoning Volume 52, Issue 2

February 2014

115 pages

ISSN:0168-7433

Issue’s Table of Contents

Copyright © Copyright © 2014 Springer Science+Business Media Dordrecht.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 February 2014

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cerna DBuran M(2024)One or Nothing: Anti-unification over the Simply-Typed Lambda CalculusACM Transactions on Computational Logic10.1145/365479825:3(1-12)Online publication date: 28-Mar-2024
https://dl.acm.org/doi/10.1145/3654798
Cerna DKutsia TElkind E(2023)Anti-unification and generalizationProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/736(6563-6573)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/736
Winter ENowack VBowes DCounsell SHall THaraldsson SWoodward JKirbas SWindels EMcBello OAtakishiyev AKells KPagano MRoychoudhury ACadar CKim M(2022)Towards developer-centered automatic program repair: findings from BloombergProceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering10.1145/3540250.3558953(1578-1588)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3540250.3558953
Alpuente MBallis DEscobar SSapiña J(2022)Variant-Based Equational Anti-unificationLogic-Based Program Synthesis and Transformation10.1007/978-3-031-16767-6_3(44-60)Online publication date: 21-Sep-2022
https://dl.acm.org/doi/10.1007/978-3-031-16767-6_3
Mehta SBhagwan RKumar RBansal CMaddila CAshok BAsthana SBird CKumar ABhagwan RPorter G(2020)RexProceedings of the 17th Usenix Conference on Networked Systems Design and Implementation10.5555/3388242.3388274(435-448)Online publication date: 25-Feb-2020
https://dl.acm.org/doi/10.5555/3388242.3388274
Bader JScott APradel MChandra S(2019)Getafix: learning to fix bugs automaticallyProceedings of the ACM on Programming Languages10.1145/33605853:OOPSLA(1-27)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360585
Cerna DKutsia T(2019)Idempotent Anti-unificationACM Transactions on Computational Logic10.1145/335906021:2(1-32)Online publication date: 2-Nov-2019
https://dl.acm.org/doi/10.1145/3359060
Barwell ABrown CHammond K(2018)Finding parallel functional pearlsFuture Generation Computer Systems10.1016/j.future.2017.07.02479:P2(669-686)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1016/j.future.2017.07.024
Baumgartner AKutsia T(2017)Unranked second-order anti-unificationInformation and Computation10.1016/j.ic.2017.01.005255:P2(262-286)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1016/j.ic.2017.01.005
Baumgartner AKutsia T(2014)Unranked Second-Order Anti-UnificationProceedings of the 21st International Workshop on Logic, Language, Information, and Computation - Volume 865210.1007/978-3-662-44145-9_5(66-80)Online publication date: 1-Sep-2014
https://dl.acm.org/doi/10.1007/978-3-662-44145-9_5
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents