Plagiarism detection in software using efficient string matching

Pandey, kusum Lata and Agarwal, S and Misra, Sanjay and Prasad, R (2012) Plagiarism detection in software using efficient string matching. In: ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part IV, Springer-Verlag Berlin, Heidelberg.

PDF Download (55kB)

Abstract

String matching refers to the problem of finding occurrence(s) of a pattern string within another string or body of a text. It plays a vital role in plagiarism detectionin software codes, where it is required to identify similar program in a large populations. String matching has been used as a tool in a software metrics, which is used to measure the quality of software development process. In the recent years, many algorithms exist for solving the string matching problem. Among them, Berry---Ravindran algorithm was found to be fairly efficient. Further refinement of this algorithm is made in TVSBS and SSABS algorithms. However, these algorithms do not give the best possible shift in the search phase. In this paper, we propose an algorithm which gives the best possible shift in the search phase and is faster than the previously known algorithms. This algorithm behaves like Berry-Ravindran in the worst case. Further extension of this algorithm has been made for parameterized string matching which is able to detect plagiarism in a software code.

Item Type:	Conference or Workshop Item (Paper)
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:	25 Mar 2014 21:46
Last Modified:	25 Mar 2014 21:46
URI:	http://eprints.covenantuniversity.edu.ng/id/eprint/2271

Actions (login required)

View Item