Software maintenance by multi-patterns parameterized string matching with q-gram

  • Authors:

  • Krishna Kumar;Rajesh Prasad;Suneeta Agarwal

  • 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

  • Venue:
  • ACM SIGSOFT Software Engineering Notes
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the multi-patterns parameterized string matching problem, a set of patterns P0, P1, P2...Pr-1, r≥1, are said to match with a sub-string t of the text T, if there exists a one-one correspondence between the symbols of patterns and the symbols of t. This problem has an important application in software maintenance, where it is often required to find equivalency between two sections of codes. Two sections of codes are said to be equivalent if one can be transformed into the other by renaming only identifiers and variables. In this paper, we extend Forward Non-deterministic Directed Acyclic Word Graph (DAWG) matching (FNDM) algorithm to PQFNDM for parameterized string matching problem by using the q-gram. Experimentally it has been observed that the performance of PQFNDM improves with increasing value of q up to half the length of the pattern. We further modify PQFNDM to MPQFNDM for handling multiple patterns. We compare the performance of PQFNDM (for q=1) with parameterized shift-or (PSO) algorithm and found that PQFNDM is better than PSO. We also show the benefits of using multiple patterns.