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

No Thumbnail Available

Date

2012

Journal Title

Journal ISSN

Volume Title

Publisher

Open Access Color

OpenAIRE Downloads

OpenAIRE Views

Research Projects

Organizational Units

Journal Issue

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 of the text T, if there exists a one-to-one correspondence between symbols of and symbols of P. 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.

Description

Keywords

Bit-parallelism, Design of algorithm, Hashing, Plagiarism detection, q-gram, Software maintenance, String matching

Turkish CoHE Thesis Center URL

Fields of Science

Citation

1

WoS Q

Q4

Scopus Q

Q3

Source

Tehnicki Vjesnik

Volume

19

Issue

2

Start Page

243

End Page

247