University Links: Home Page | Site Map
Covenant University Repository

Maintaining software through Bit-Parallelism and Hashing the Parameterized Q-Grams.

Prasad, R and Agarwal, S and Misra, Sanjay and Sharma, Anuj Kumar and Singh , Alok (2012) Maintaining software through Bit-Parallelism and Hashing the Parameterized Q-Grams. Održavanje softvera binarnim paralelizmom i pristupanje podacima parametariziranim q-gramima, 19 (2). pp. 243-247. ISSN 1330-3651

Full text not available from this repository.


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 is said to match with a substring of the text , if there exists a one-to-one correspondence between symbols of and symbols of . In this paper, we propose an efficient algorithm for this problem by using both the overlapping and non-overlapping -gram.We show the effect of running time of the algorithm on increasing the duplicity present in the code.

Item Type: Article
Uncontrolled Keywords: bit-parallelism, design of algorithm, hashing, plagiarism detection, q-gram , software maintenance, string matching
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
Divisions: Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science
Depositing User: Mrs Patricia Nwokealisi
Date Deposited: 24 Mar 2014 16:52
Last Modified: 24 Mar 2014 16:52

Actions (login required)

View Item View Item