Anti-unification Algorithms and Their Applications in Program Analysis

  title={Anti-unification Algorithms and Their Applications in Program Analysis},
  author={P. Bulychev and Egor V. Kostylev and V. A. Zakharov},
  booktitle={Ershov Memorial Conference},
  • P. Bulychev, Egor V. Kostylev, V. A. Zakharov
  • Published in Ershov Memorial Conference 2009
  • Computer Science
  • A term t is called a template of terms t1 and t2 iff t1=tη1 and t2=tη2, for some substitutions η1 and η2. A template t of t1 and t2 is called the most specific iff for any template t′ of t1 and t2 there exists a substitution ξ such that t=t′ξ. The anti-unification problem is that of computing the most specific template of two given terms. This problem is dual to the well-known unification problem, which is the computing of the most general instance of terms. Unification is used extensively in… CONTINUE READING
    23 Citations
    A modular order-sorted equational generalization algorithm
    • 30
    • PDF
    Monads for the formalization of a pattern matching procedure
    • 3
    RISC-Linz Research Institute for Symbolic Computation
    • PDF
    Is it possible to unify sequential programs?
    • 1
    Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification
    • 11
    • PDF
    Global Guidance for Local Generalization in Model Checking
    • 3
    • PDF
    Anti-unification for Unranked Terms and Hedges
    • 17
    • PDF


    Efficient parallel term matching and anti-unification
    • 15
    A Machine-Oriented Logic Based on the Resolution Principle
    • 4,221
    • PDF
    Parallel Algorithms for Term Matching
    • 36
    A Temporal Logic of Nested Calls and Returns
    • 3,369
    • PDF
    An Efficient Unification Algorithm
    • 868
    • PDF
    Duplicate code detection using anti-unification
    • 57
    • PDF
    A Survey on Software Clone Detection Research
    • 658
    • PDF
    Algebraic Properties of Idempotent Substitutions
    • 97
    Properties of Substitutions and Unifications
    • E. Eder
    • Mathematics, Computer Science
    • GWAI
    • 1983
    • 92