Unranked second-order anti-unification
From MaRDI portal
Publication:2401634
DOI10.1016/j.ic.2017.01.005zbMath1372.68152OpenAlexW2579137497MaRDI QIDQ2401634
Alexander Baumgartner, Temur Kutsia
Publication date: 4 September 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2017.01.005
anti-unification using context and hedge variablesgeneralization of forestshigher-order anti-unification for unranked terms and hedges
Related Items
Unnamed Item, Term-Graph Anti-Unification, Higher-order pattern generalization modulo equational theories, A Generic Framework for Higher-Order Generalizations.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient parallel term matching and anti-unification
- Comparison and evaluation of code clone detection techniques and tools: A qualitative approach
- Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.
- Bottom-up induction of feature terms
- Higher order generalization and its application in program verification
- Anti-unification for unranked terms and hedges
- Generalized LCS
- A modular order-sorted equational generalization algorithm
- E-generalization using grammars
- On theories with a combinatorial definition of 'equivalence'
- An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
- A Variant of Higher-Order Anti-Unification
- Anti-unification Algorithms and Their Applications in Program Analysis
- Unification, weak unification, upper bound, lower bound, and generalization problems
- Algorithms and Computation
