Abstract:
A semantics-preserving transformation by Komondoor and Horwitz has been shown to be most effective in the elimination of type-3 clones. The two original algorithms for re...Show MoreMetadata
Abstract:
A semantics-preserving transformation by Komondoor and Horwitz has been shown to be most effective in the elimination of type-3 clones. The two original algorithms for realizing this transformation, however, are not as efficient as the related (slice-based) transformations. We present an asymptotically-faster algorithm that implements the same transformation via bidirectional reachability on a program dependence graph, and we prove its equivalence to the original formulation.
Published in: 2017 IEEE 24th International Conference on Software Analysis, Evolution and Reengineering (SANER)
Date of Conference: 20-24 February 2017
Date Added to IEEE Xplore: 23 March 2017
ISBN Information: