Search citation statements

Select...

1

1

1

1

0

9

0

Year Published

2013

2018

Publication Types

Select...

3

1

Relationship

0

4

Authors

Journals

0

9

0

“…4. Among them, we say that the first one is The standard anti-unification [31,32] has already been considered for computing software clones by Bulychev and Minea [8], Bulychev et al [9], Li and Thompson [27], detecting mostly clones of types I and II. However, we think that parametrized anti-unification over unranked terms offers more flexibility in finding clone candidates.…”

“…In Plotkin and Reynolds' original work [10,15], anti-unification was defined for totally ordered terms, where terms consisted of variables, literals, and function application. More recent approaches to anti-unification have applied the technique to programming languages such as Haskell [16,17], primarily for clone detection and elimination [18]. In these approaches, anti-unification compares two terms (expressions) to find their shared structure, producing an anti-unifier term (representing the shared structure), plus two sets of substitutions that enable the original term to be reconstructed from the anti-unifier.…”

“…Antiunification is also used in test case generation techniques to achieve appropriate coverage (Belli and Jack, 1998). Applications of generalization to invariant generation and software clone detection are described in (Bulychev et al, 2010). Suggestion for auxiliary lemmas in equational inductive proofs, computation of construction laws for given term sequences, and learning of screen editor command sequences by using generalization are discussed in (Burghardt, 2005).…”

“…When terms in substitutions are presented by trees then the size of glb(θ 1 , θ 2 ) does not exceed the sizes of θ 1 and θ 2 , but the size of θ 1 θ 2 may be proportional to the product of the sizes of θ 1 and θ 2 . On the other hand, when terms are presented by directed acyclic graphs the size of θ 1 θ 2 does not exceed the sum of the sizes of θ 1 and θ 2 , but as it was shown in [3] the size of glb(θ 1 , θ 2 ) may be proportional to the product of the sizes of θ 1 and θ 2 . Since these operations interleave along an iterative computation, the size of resulting substitution may grow exponentially with the number of steps.…”

“…It has been first considered by G.D. Plotkin [12] and J. Reynolds [13], studied in [4,10] and found applications in supercompilation [15], symbolic computing [9,16], program verification and refactoring [2,3].…”