CoChat

Mossad: defeating software plagiarism detection

Open access
Devore-McDonald, Breanna, Berger, Emery D. · 2020 · Proceedings of the ACM on Programming Languages

The DOI matches its Crossref record; the references it cites are not checked yet.

Abstract

Automatic software plagiarism detection tools are widely used in educational settings to ensure that submitted work was not copied. These tools have grown in use together with the rise in enrollments in computer science programs and the widespread availability of code on-line. Educators rely on the robustness of plagiarism detection tools; the working assumption is that the effort required to evade detection is as high as that required to actually do the assigned work. This paper shows this is not the case. It presents an entirely automatic program transformation approach, MOSSAD, that defeats popular software plagiarism detection tools. MOSSAD comprises a framework that couples techniques inspired by genetic programming with domain-specific knowledge to effectively undermine plagiarism detectors. MOSSAD is effective at defeating four plagiarism detectors, including Moss and JPlag. MOSSAD is both fast and effective: it can, in minutes, generate modified versions of programs that are likely to escape detection. More insidiously, because of its non-deterministic approach, MOSSAD can, from a single program, generate dozens of variants, which are classified as no more suspicious than legitimate assignments. A detailed study of MOSSAD across a corpus of real student assignments demonstrates its efficacy at evading detection. A user study shows that graduate student assistants consistently rate MOSSAD-generated code as just as readable as authentic student code. This work motivates the need for both research on more robust plagiarism detection tools and greater integration of naturally plagiarism-resistant methodologies like code review into computer science education.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3428206

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

The citation lists are queued

They are fetched later and appear here then.

References 25 · Cited by 35

Research works printed but not linked: 6

  1. [5]5. K. Bowyer and L. Hall. Experience using "MOSS" to detect cheating on programming assignments. FIE'99 Frontiers in Education. 29th Annual Frontiers in Education Conference. Designing the Future of Science and Engineering Education. Conference Proceedings (IEEE Cat. No.99CH37011, 3:13B3/18-13B3/22 vol.3, 1999.
  2. [18]18. Claire Le Goues, ThanhVu Nguyen, Stephanie Forrest, and Westley Weimer. GenProg: A generic method for automatic software repair. IEEE Transactions on Software Engineering, 38(1):54-72, 2011.
  3. [27]27. Lutz Prechelt, Guido Malpohl, and Michael Philippsen. Finding plagiarisms among a set of programs with JPlag. Journal of Universal Computer Science, 8(11):1016-1038, 2002.
  4. [31]31. Saul Schleimer, Daniel S Wilkerson, and Alex Aiken. Winnowing: local algorithms for document fingerprinting. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pages 76-85. ACM, 2003.
  5. [33]33. Temple F Smith, Michael S Waterman, et al. Identification of common molecular subsequences. Journal of molecular biology, 147(1):195-197, 1981.
  6. [34]34. Jeong-Woo Son, Seong-Bae Park, and Se-Young Park. Program plagiarism detection using parse tree kernels. In Lecture Notes in Computer Science, pages 1000-1004. Springer Berlin Heidelberg, 2006. URL https://doi.org/10.1007/978-3-540- 36668-3_122. · doi:10.1007/978-3-540-

Metadata

Authors
Devore-McDonald, B., & Berger, E. D.
Affiliations
University of Massachusetts Amherst (US)
Venue
Proceedings of the ACM on Programming Languages
Published
2020-11-13
Volume
4
Issue
OOPSLA
Pages
1-28
ISSN
2475-1421 (ISSN-L)
OpenAlex
W3091836068
Cited by
35
References
25
Citations by year
2026: 3 · 2025: 7 · 2024: 13 · 2023: 3 · 2022: 6 · 2021: 3
FWCI
4.13
Type
journal article
Language
en
Open access
Locations
  • Proceedings of the ACM on Programming Languages (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
NSF (CCF-1439008 and CCF-1617892)
Topics
  • Social Sciences › Education › Academic integrity and plagiarism
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
  • Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
Keywords
software plagiarism detection, program transformation, Mossad, genetic programming, bryophytes, JPlag, student code, code readability, code review, computer science education

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Mossad: defeating software plagiarism detection. https://app.cochat.ai/papers/10.1145/3428206
The paper
Devore-McDonald, B., & Berger, E. D. (2020). Mossad: defeating software plagiarism detection. Proceedings of the ACM on Programming Languages. https://doi.org/10.1145/3428206

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.