Maintaining Software Through Bit-Parallelism and Hashing the Parameterized Q-Grams;

No Thumbnail Available

Date

2012

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Open Access Color

OpenAIRE Downloads

OpenAIRE Views

Research Projects

Organizational Units

Thumbnail Image
Organizational Unit
Computer Engineering
(1998)
The Atılım University Department of Computer Engineering was founded in 1998. The department curriculum is prepared in a way that meets the demands for knowledge and skills after graduation, and is subject to periodical reviews and updates in line with international standards. Our Department offers education in many fields of expertise, such as software development, hardware systems, data structures, computer networks, artificial intelligence, machine learning, image processing, natural language processing, object based design, information security, and cloud computing. The education offered by our department is based on practical approaches, with modern laboratories, projects and internship programs. The undergraduate program at our department was accredited in 2014 by the Association of Evaluation and Accreditation of Engineering Programs (MÜDEK) and was granted the label EUR-ACE, valid through Europe. In addition to the undergraduate program, our department offers thesis or non-thesis graduate degree programs (MS).

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

URI

https://hdl.handle.net/20.500.14411/9336

Collections

Scopus