Finding Plagiarisms among a Set of Programs with JPlag

By Lutz Prechelt, G. Malpohl, M. Philippsen. Journal of universal computer science (Online), 2002

665 citations recorded by the source corpus.

JPlag is a web service that finds pairs of similar programs among a given set of programs. It has successfully been used in practice for detecting plagiarisms among student Java program submissions. Support for the languages C, C++ and Scheme is also available. We describe JPlag's architecture and its comparsion algorithm, which is based on a known one called Greedy String Tiling. Then, the contribution of this paper is threefold: First, an evaluation of JPlag's performance on several rather different sets of Java programs shows that JPlag is very hard to deceive. More than 90 percent of the 77 plagiarisms within our various benchmark program sets are reliably detected and a majority of the others at least raise suspicion. The run time is just a few seconds for submissions of 100 programs of several hundred lines each. Second, a parameter study shows that the approach is fairly robust with respect to its configuration parameters. Third, we study the kinds of attempts used for disguising plagiarisms, their frequency, and their success.

Subfields: Safety Research

View Paper: https://www.semanticscholar.org/paper/3b40ae4486e8f455331692e07a06a46b25728f68

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Safety Research

  1. Kirsti Ala-Mutka
  2. Philip S. Yu
  3. Shan Lu
  4. Yuanyuan Zhou
  5. Satish Narayanasamy
  6. Michael J. Cafarella
  7. Jonathan Crussell
  8. Clint Gibler

Citations in the corpus