Efficient algorithm for detecting parameterized multiple clones in a large software system

  • Authors:

  • Rajesh Prasad;Suneeta Agarwal;Anuj Kumar Sharma;Alok Singh;Sanjay Misra

  • Affiliations:

  • Motilal Nehru National Institute of Technology, Allahabad, India;Motilal Nehru National Institute of Technology, Allahabad, India;Motilal Nehru National Institute of Technology, Allahabad, India;Motilal Nehru National Institute of Technology, Allahabad, India;Department of Computer Engineering, Federal University of Technology, Minna, Nigeria

  • Venue:
  • ICCSA'11 Proceedings of the 2011 international conference on Computational science and Its applications - Volume Part V
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Two code fragments are said to be similar if they are similar in their program text or in their functionalities. The first kind of similarity can be detected with the help of parameterized string matching. In this type of matching, a given pattern P is said to match with a sub-string t of the text T, if there exists a bijection between the symbols of P and the symbols of t. The parameterized string matching problem has been efficiently solved by Fredriksson and Mozgovoy by using the shift-or (PSO) algorithm. The drawback of this algorithm is: it is unable to handle patterns of length greater than the word length (w) of a computer. In this paper, we solve this word length problem in a bitparallel parameterized matching by extending the BLIM algorithm of exact string matching. Extended algorithm is also suitable for searching multiple patterns simultaneously. Experimentally, it has been observed that our algorithm is comparable with PSO for pattern length ≤ w and has ability to handle longer patterns efficiently.