Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Related Work in Plagiarism Detection
Experiments: Sensitivity and Specificity Analysis
Case Studies -To Be and Not to Be Caught
Discussions
References
All Topics
Mathematics
Other Physical Sciences and Mathematics

Shared information and program plagiarism detection

Profile image of Xin ChenXin Chen

2004, IEEE Transactions on Information Theory

https://doi.org/10.1109/TIT.2004.830793
visibility

…

description

12 pages

link

1 file

Abstract

A fundamental question in information theory and in computer science is how to measure similarity or the amount of shared information between two sequences. We have proposed a metric, based on Kolmogorov complexity to answer this question, and have proven it to be universal. We apply this metric in measuring the amount of shared information between two computer programs, to enable plagiarism detection. We have designed and implemented a practical system SID (Software Integrity Diagnosis system) that approximates this metric by a heuristic compression algorithm. Experimental results demonstrate that SID has clear advantages over other plagiarism detection systems. SID system server is online at

Related papers

Does automated anti-plagiarism have to be complex? Evaluating more appropriate software metrics for finding collusion
Thomas Lancaster

2005

Abstract Much research in the plagiarism detection literature relates to attempting to discover which students have copied student source code submissions from one another–a process commonly known as collusion. The majority of the collusion literature suggests that structure metrics (metrics that look beyond semantics to attempt to find disguise) are the most appropriate comparators for finding such collusion.

View PDFchevron_right
Syntax-based Improvements to Plagiarism Detectors and their Evaluations
Mehmet Emre ÖZ

Proceedings of the 2019 ACM Conference on Innovation and Technology in Computer Science Education, 2019

Software plagiarism cheats students out of their own education and leads to unfair grading, making software plagiarism detection an important problem. However, many popular plagiarism detection tools are inaccurate, language-specific, or closed source, limiting their applicability. In this work, we seek to address these problems via a novel approach. We adapt the optimal Smith-Waterman sequence alignment algorithm to precisely measure the similarity between programs, greatly improving detection accuracy relative to competitors. Our approach is applicable to any language describable by an ANTLR grammar, which includes most programming languages. We also provide a new type of evaluation based on random program generation and obfuscation. Finally, we make our approach freely available, allowing for customizations and transparent reasoning about detection behavior.

View PDFchevron_right
Towards Reliable Code Plagiarism Detection: A Survey on Software Clone Detection
Dr. S G Gollagi

Zenodo (CERN European Organization for Nuclear Research), 2023

Despite substantial study over the past three decades resulting in the development of more than 250 clone detection technologies, there is no one framework that can accurately and reliably identify all four major types of clones. The lack of comprehensive, reliable, and language-neutral code clone detection has a significant negative influence on online learning systems like Coursera, which are unable to assess the proficiency of students in coding projects and assignments they submit to the online platforms. This survey paper can contribute to building more reliable code plagiarism detection by presenting various tools and techniques to find the same language and cross-language clone types with respect to the clone types they detect and the languages they work on. The paper highlights 3 major issues in terms of language agnostic nature and accuracy a) Most of the proposed techniques work only on a specific language like C, CPP, Java, or Python for detecting clones. b) Only 8 proposed works accurately classify all 4 basic clone types. c) 98% of the clone detection in the past is based on regular clones ignoring micro clones. The summary of the paper can provide proper directions in building a more reliable code plagiarism detection tool.

View PDFchevron_right
Theses and Capstone Projects Plagiarism Checker using Kolmogorov Complexity Algorithm
Julius Sareno

Walailak Journal of Science and Technology (WJST)

In education, students attempt to copy previous works and are relying on prepared solutions available on the Internet in order to meet their requirements. This action leads to plagiarism, which is becoming part of educational institutions’ concern to reduce growing academic dishonesty. With regards to the aforementioned issue, this study aims to design and develop a plagiarism checker capable of registering documents, granting access to users, and calculating the similarity between documents. Thus, the software was constructed using HTML, PHP, JavaScript, CSS, and MySQL. The developed system is composed of three main modules; the Document Search which enables users to browse documents, the Document Registration which enables the administrator to add and manage the stored documents, and the document Comparison, which serves as the system plagiarism detection mechanism. The algorithm Normalized Compression Distance was used to measure similarity and the Boyer-Moore Algorithm to highli...

View PDFchevron_right
On the Importance of Lexicon, Structure and Style for Identifying Source Code Plagiarism
Christian Sánchez

Proceedings of the Forum for Information Retrieval Evaluation on - FIRE '14, 2015

Source code plagiarism can be identified by analyzing similarities of several and diverse aspects of a pair of source code. In this paper we present three types of similarity features that account for three aspects of source code documents, particularly: i) lexical, ii) structural, and iii) stylistics. From the lexical view, we used a character 3-gram model without considering reserved words for the programming language in revision. For the structural view, we proposed two similarity metrics that take into account the function's signatures within a source code, namely the data types and the identifier's names of the function's signature. The third view consists on accounting for several stylistics' features, such as the number of white spaces, lines of code, upper letters, etc. Accordingly, we proposed 8 similarity features to represent pairs of source code in order to, under a supervised approach, identify plagiarized pairs of source codes. We use a set of more than 32000 source code documents from Java and C to perform our experiments. The results show the pertinence of our set of features to identify plagiarism for source code documents that satisfy particular conditions, such as, source code that solve difficult problems. CCS Concepts •Information systems → Content analysis and feature selection; Near-duplicate and plagiarism detection; •Applied computing → Document analysis;

View PDFchevron_right
Metrics based plagiarism monitoring
Edward L Jones, PhD

2001

Plagiarism in programming courses is a pervasive and frustrating problem that undermines the educational process. Defining plagiarism is difficult because of the fuzzy boundary between allowable peer-peer collaboration and plagiarism. Pursuing suspected plagiarism has attendant emotional and legal risks to the student and teacher, with the teacher bearing the burden of proof. In this paper we present a metrics-based system for monitoring similarities between programs and for gathering the "preponderance" of evidence needed to pursue suspected plagiarism. Anonymous results from monitoring are posted to create a climate in which the issue of plagiarism is discussed openly.

View PDFchevron_right
Program Similarity Detection Tool
Kevin Garda

International Journal of Engineering Research and, 2016

Plagiarism is copying another's work. Copying source code frequently happens in programming assignments in colleges. Direct copying does constitute academic dishonesty. So the student should be motivated to gain more understanding by typing independently than by copying code directly. The work in this paper presents a tool which would be used for detecting plagiarism in the programs performed by students. Also this would be used to detect whether the source code is copied from internet. Input to the tool would be the programs that need to be checked for plagiarism. The tool would give output as percentage of plagiarism detected between each pairs.

View PDFchevron_right
A Generic framework for plagiarism detection in programs
Gergely Lukácsy, Péter Szeredi

The paper presents a plagiarism detection framework, which aims to determine the similarity degree of program source codes. The issue of plagiarism detection has been considered earlier for written material, such as student essays. For these, text-based algorithms have been published. We argue that in case of pro-gram code comparison, structure based techniques may be much more efficient. The main idea is to transform the source code into mathematical objects, use appropriate reduction and comparison methods on them, and interpret the results appropriately. We have designed a generic program structure comparison framework and imple-mented it for the Prolog and SML programming languages. We have been using the implementation to successfully detect plagiarism in student assignments since 2000.

View PDFchevron_right
A Combined Weighted Approach to Detect Code Cloning
Dr.Sushil Garg
View PDFchevron_right
Plagiarism Revealing in the Source Program Code on the Basis of Its Syntactic Representation
Tetyana Shatovska

2011

This paper considers the existing approaches and models of data representation applicable for the problem task of plagiarism revealing in the source code. This paper present an approach based on the solution concerning syntactic comparison of source codes for the task of plagiarism revealing in students course code. The first phase of analysis, this calculation of quantitative characteristics of the source code, in other words, an attribute algorithm. This preliminary calculation allows us to obtain an overall picture of project files, which is subjected to analysis. Attribute algorithm allows us to discard obviously not like a pair of source files in a relatively short period of time, resulting in we will get the abbreviated set of couples who want to compare the structural algorithm. The next phase is he analysis of potentially similar files of a structural algorithm. In this paper, a measure of similarity of these files have been selected as the value of the greatest common subtr...

View PDFchevron_right

References (24)

  1. A. Aiken. Measure of software similarity. URL http://www.cs.berkeley.edu/∼aiken/moss.html.
  2. D. Benedetto, E. Caglioti, and V. Loreto, Language trees and zipping. Physical Review Letters, 88:4(2002).
  3. C.H. Bennett, P. Gács, M. Li, P. Vitányi, and W. Zurek, Information Distance. IEEE Transactions on Information Theory, 44:4(July 1998), 1407-1423.
  4. C. Bennett, M. Li and B. Ma. Chain letters and evolutionary histories. Scientific American, June 2003, 71-76.
  5. X. Chen, S. Kwong and M. Li. A compression algorithm for DNA sequences and its applications in genome comparison. In Proc. of the 10th Workshop on Genome Informatics, pp. 52-61, 1999.
  6. R. Cilibrasi, R. de Wolf and P. Vitányi. Algorithmic clustering of music, http://arxiv.org/archive/cs/0303025, 2003.
  7. D. Gitchell and N. Tran. A utility for detecting similarity in computer programs. Proceedings of 30th SCGCSE Technical Symposium, New Orleans, USA. pp. 266-270, 1998.
  8. M. Li, J. Badger, X. Chen, S. Kwong, P. Kearney and H. Zhang. An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinformatics. 17:2(2001), 149-154.
  9. M. Li and P. Vitányi. An introduction to Kolmogorov complexity and its applications. 2nd Ed., Springer, New York, 1997.
  10. M. Li, X. Chen, X. Li, B. Ma, P. Vitanyi. The similarity metric. In Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 863-872, 2003.
  11. M. Li and P. Vitanyi. Reversibility and adiabatic computation: trading time and space for energy. Proc. Royal Society of London, Series A, 452(1996), 769-789.
  12. T. Luczak and W. Szpankowski. A suboptimal lossy data compression based on approximate pattern matching, IEEE Transactions on Information Theory 43:5(1997), 1439-1451.
  13. G. Malpohl. JPlag: detecting software plagiarism. URL http://www.ipd.uka.de:2222/index.html.
  14. K. Ottenstein. An algorithmic approach to the detection and prevention of plagiarism. SIGCSE Bulletin 8:4(1977), 30-41.
  15. A. Parker and J. Hamblen. Computer algorithms for plagiarism detection. IEEE Transactions on Educa- tion. 32:2(1989), 94-99.
  16. S. Schleimer, D.S. Wilkerson, and A. Aiken. Winnowing: local algorithms for document figureprinting. ACM SIGMOD Conference, June 9-12, 2003, San Diego.
  17. C.E. Shannon, A mathematical theory of communication. Bell System Technical Journal, 27(July and October, 1948) 379-423 and 623-656.
  18. W. Weaver and C.E. Shannon, The Mathematical Theory of Communication. University of Illinois Press, 1949.
  19. G. Whale. Plague: plagiarism detection using program structure. Dept. of Computer Science Technical Report 8805, University of NSW, Kensington, Australia, 1988.
  20. G. Whale. Identification of program similarity in large populations. The Computer Journal, 33:2(1990).
  21. M. Wise. Running Karp-Rabin matching and greedy string tiling. Department of Computer Science tech- nical report, Sydney University, 1994.
  22. M. Wise. YAP3: improved detection of similarities in computer program and other texts. Proceedings of 27th SCGCSE Technical Symposium, Philadelphia, USA. 130-134, 1996.
  23. E.-H. Yang and J.C. Kieffer. On the performance of data compression algorithms based upon string match- ing, IEEE Transactions on Information Theory 44(1998), 47-65.
  24. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23(1977), 337-343.

Related papers

Program Plagiarism Detection
David Simoes

Parker and Hamblen defi ne software plagiarism as "a program that has been produced from another program with trivial text edit operations and without detailed understanding of the program". In practice, if one program can be transformed into another simply through use of editor operations (such as global substitutions) or by exploiting synonymous expressions provided by the programming language, then a probable case of plagiarism has been found and should be examined further. We propose a metric to solve this problem based on the amount of shared information between two computer programs. We designed and implemented a system, TokenMatch, to enable plagiarism detection and we demonstrate experimental results to prove its eff ectiveness.

View PDFchevron_right
Detecting Source Code Similarity Using Compression
Gordana Rakic

2019

Automatic assessment systems encounter significant problems when assessing students’ solutions to programming assignments. Main difficulties arise from lack of academic discipline among the students. While the students are expected to submit their original solutions, sometimes this is not the case. The assignments that they are expected to solve are usually very similar, and there is a restricted set of varieties among the correct solutions. Therefore, plagiarism detection is always an open question in the assessment of students’ work. Multiple tools and approaches are available for plagiarism detection. They are based on source code similarity detection algorithms or code clone detection tools. Available approaches rely on lexical, syntactic, structural, or semantic information about the programming solution. Thus, algorithms analyze character streams, token streams, controls structures or dependencies in the observed code. Usually, they are applied to the source code or some of it...

View PDFchevron_right
Language-Independent Clone Detection Applied to Plagiarism Detection
Romain Robbes

2010 10th IEEE Working Conference on Source Code Analysis and Manipulation, 2010

Clone detection is usually applied in the context of detecting small-to medium scale fragments of duplicated code in large software systems. In this paper, we address the problem of clone detection applied to plagiarism detection in the context of source code assignments done by computer science students. Plagiarism detection comes with a distinct set of constraints to usual clone detection approaches, which influenced the design of the approach we present in this paper. For instance, the source code can be heavily changed at a superficial level (in an attempt to look genuine), yet be functionally very similar.

View PDFchevron_right
GPLAG: detection of software plagiarism by program dependence graph analysis
chao liu

2006

Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source projects for its own products. Although current plagiarism detection tools appear sufficient for academic use, they are nevertheless short for fighting against serious plagiarists. For example, disguises like statement reordering and code insertion can effectively confuse these tools. In this paper, we develop a new plagiarism detection tool, called GPlag, which detects plagiarism by mining program dependence graphs (PDGs). A PDG is a graphic representation of the data and control dependencies within a procedure. Because PDGs are nearly invariant during plagiarism, GPlag is more effective than state-of-the-art tools for plagiarism detection. In order to make GPlag scalable to large programs, a statistical lossy filter is proposed to prune the plagiarism search space. Experiment study shows that GPlag is both effective and efficient: It detects plagiarism that easily slips over existing tools, and it usually takes a few seconds to find (simulated) plagiarism in programs having thousands of lines of code.

View PDFchevron_right
A Source Code Similarity System for Plagiarism Detection
Dragan Gasevic

The Computer Journal, 2013

Source code plagiarism is an easy to do task, but very difficult to detect without proper tool support. Various source code similarity detection systems have been developed to help detect source code plagiarism. Those systems need to recognize a number of lexical and structural source code modifications. For example, by some structural modifications (e.g., modification of control structures, modification of data structures or structural redesign of source code) the source code can be changed in such a way that it almost looks genuine. Most of the existing source code similarity detection systems can be confused when these structural modifications have been applied to the original source code. In order to be considered effective, a source code similarity detection system must address these issues. In order to address them, we designed and developed the source code similarity system for plagiarism detection. To demonstrate that the proposed system has the desired effectiveness, we performed a wellknown conformism test. The proposed system showed promising results as compared to the JPlag system in detecting source code similarity when various lexical or structural modifications are applied to plagiarized code. As a confirmation of these results, an independent samples t-test revealed that there was a statistically significant difference between average values of F-measures for the test sets that we used and for the experiments that we have done in the practically usable range of cut-off threshold values of 35%-70%.

View PDFchevron_right

Related topics

  • Information Theory
  • Plagiarism Detection
  • Software Integration
  • Electrical and Electronic Engine...

    • Cited by

    Forensic Authorship Attribution Using Compression Distances to Prototypes
    Kavita Patil-Pawar

    2009

    In several situations authors prefer to hide their identity. In forensic applications, one can think of extortion and threats in emails and forum messages. These types of messages can easily be adjusted, such that meta data referring to names and addresses is at least unreliable. In this paper, we propose a method to identify authors of short informal messages solely based on the text content. The method uses compression distances between texts as features. Using these features a supervised classifier is learned on a training set of known authors. For the experiments, we prepared a dataset from Dutch newsgroup texts. We compared several state-of-the-art methods to our proposed method for the identification of messages from up to 50 authors. Our method clearly outperformed the other methods. In 65% of the cases the author could be correctly identified, while in 88% of the cases the true author was in the top 5 of the produced ranked list.

    View PDFchevron_right
    Neuronal Functional Connection Graphs among Multiple Areas of the Rat Somatosensory System during Spontaneous and Evoked Activities
    Gian Caramenti

    PLoS Computational Biology, 2013

    Small-World Networks (SWNs) represent a fundamental model for the comprehension of many complex man-made and biological networks. In the central nervous system, SWN models have been shown to fit well both anatomical and functional maps at the macroscopic level. However, the functional microscopic level, where the nodes of a network are represented by single neurons, is still poorly understood. At this level, although recent evidences suggest that functional connection graphs exhibit small-world organization, it is not known whether and how these maps, potentially distributed in multiple brain regions, change across different conditions, such as spontaneous and stimulus-evoked activities. We addressed these questions by analyzing the data from simultaneous multi-array extracellular recordings in three brain regions of rats, diversely involved in somatosensory information processing: the ventropostero-lateral thalamic nuclei, the primary somatosensory cortex and the centro-median thalamic nuclei. From both spike and Local Field Potential (LFP) recordings, we estimated the functional connection graphs by using the Normalized Compression Similarity for spikes and the Phase Synchrony for LFPs. Then, by using graph-theoretical statistics, we characterized the functional topology both during spontaneous activity and sensory stimulation. Our main results show that: (i) spikes and LFPs show SWN organization during spontaneous activity; (ii) after stimulation onset, while substantial functional graph reconfigurations occur both in spike and LFPs, small-worldness is nonetheless preserved; (iii) the stimulus triggers a significant increase of inter-area LFP connections without modifying the topology of intra-area functional connections. Finally, investigating computationally the functional substrate that supports the observed phenomena, we found that (iv) the fundamental concept of cell assemblies, transient groups of activating neurons, can be described by small-world networks. Our results suggest that activity of neurons from multiple areas of the rat somatosensory system contributes to the integration of local computations arisen in distributed functional cell assemblies according to the principles of SWNs.

    View PDFchevron_right
    Image characterization and classification by physical complexity
    Hector Zenil

    Complexity, 2012

    We present a method for estimating the complexity of an image based on the concept of logical depth. Unlike the application of the concept of algorithmic complexity by itself, the addition of the concept of logical depth results in a characterization of objects by organizational (physical) complexity. We use this measure to classify images by their information content. The method provides a means for evaluating and classifying objects by way of their visual representations.

    View PDFchevron_right
    Input–output maps are strongly biased towards simple outputs
    Chico Q Camargo

    Nature Communications

    Many systems in nature can be described using discrete input-output maps. Without knowing details about a map, there may seem to be no a priori reason to expect that a randomly chosen input would be more likely to generate one output over another. Here, by extending fundamental results from algorithmic information theory, we show instead that for many real-world maps, the a priori probability P(x) that randomly sampled inputs generate a particular output x decays exponentially with the approximate Kolmogorov complexityKðxÞ of that output. These input-output maps are biased towards simplicity. We derive an upper bound P(x) ≲ 2 ÀaKðxÞÀb , which is tight for most inputs. The constants a and b, as well as many properties of P(x), can be predicted with minimal knowledge of the map. We explore this strong bias towards simple outputs in systems ranging from the folding of RNA secondary structures to systems of coupled ordinary differential equations to a stochastic financial trading model.

    View PDFchevron_right
    Plagiarism detection in students’ programming assignments based on semantics: multimedia e-learning based smart assessment methodology
    Sohail Jabbar

    Multimedia Tools and Applications, 2018

    The multimedia-based e-Learning methodology provides virtual classrooms to students. The teacher uploads learning materials, programming assignments and quizzes on university' Learning Management System (LMS). The students learn lessons from uploaded videos and then solve the given programming tasks and quizzes. The source code plagiarism is Multimed Tools Appl

    View PDFchevron_right
    580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved