Cited by 23Software Engineering ResearchAcademic integrity and plagiarismTeaching and Learning Programming

Syntax-based Improvements to Plagiarism Detectors and their Evaluations

Open access
Nichols, Lawton, Dewey, Kyle, Emre, Mehmet, Chen, Sitao, Hardekopf, Ben·2019·Proceedings of the 2019 ACM Conference on Innovation and Technology in Computer Science Education

Abstract

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.

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1145/3304221.3319789

Cites

17 of 17 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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?

  • State-of-the-art plagiarism detectors operate token-based and compare the code's structure.

    “State-ofthe-art plagiarism detectors operate token-based and compare the code's structure [31].”

    From Detecting Automatic Software Plagiarism via Token Sequence Normalization (2024) · cites this paper as [31]

    Section 2.2 describes token-based detectors, including JPLAG, and detectors that compare syntax trees. But it distinguishes these approaches: token sequences lose some program structure, which is why the authors’ detector uses parse trees instead. The source does not support the blanket claim that state-of-the-art detectors are both token-based and structural. (LLM, conf=0.85)

    Experimental — accuracy not yet measured
  • Mossad's approach is mainly designed against token-based plagiarism detectors but has the potential for attacks on other structure-based software plagiarism detectors.

    “Their approach is mainly designed against token-based plagiarism detectors but has the potential for attacks on other structure-based [31] software plagiarism detectors.”

Self-check

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

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

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Nichols, L., Dewey, K., Emre, M., Chen, S., & Hardekopf, B.
Affiliations
  • University of California, Santa Barbara (US)
  • California State University, Northridge (US)
Venue
Proceedings of the 2019 ACM Conference on Innovation and Technology in Computer Science Education
Publisher
ACM
Published
2019-07-02
Pages
555-561
OpenAlex
W2963625196
Cited by
22
References
17
Citations by year
2026: 2 · 2025: 2 · 2024: 4 · 2023: 4 · 2022: 3 · 2021: 4 · 2020: 3
FWCI
1.99
Type
conference paper
Language
en
Open access
Locations
ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE) (publishedVersion, other-oa)
Funders
NSF (CCF-1319060)
Topics
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
  • Social Sciences › Safety Research › Academic integrity and plagiarism
  • Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
Keywords
software plagiarism detection, code similarity, programming language syntax, code obfuscation, academic dishonesty

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