Original scientific paper

Maintaining software through bit-parallelism and hashing the parameterized q-grams

Rajesh Prasad ; Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology, Alahabad, India
Suneeta Agarwal ; Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology, Alahabad, India
Sanjay Misra ; Department of Computer Engineering, Faculty of Engineering, Atilim University, Ankara, Turkey
Anuj Kumar Sharma ; Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology, Alahabad, India
Alok Singh ; Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology, Alahabad, India

Abstract

In the software maintenance, it is often required to find duplicity present in the codes. Two code fragments are equivalent, if one can be transformed into the other via consistent renaming of identifiers, literals and variables. This equivalency can be detected by parameterized string matching. In this matching, a given pattern P is said to match with a substring t of the text T, if there exists a one-to-one correspondence between symbols of P and symbols of t. In this paper, we propose an efficient algorithm for this problem by using both the overlapping and non-overlapping q-gram. We show the effect of running time of the algorithm on increasing the duplicity present in the code.

Keywords

bit-parallelism; design of algorithm; hashing, plagiarism detection; q-gram; software maintenance; string matching

Hrčak ID:

83857

URI

https://hrcak.srce.hr/83857

Publication date:

29.6.2012.

Article data in other languages: croatian

Visits: 1.589 *