Detection of similarities in student programs: YAP'ing may be preferable to plague'ing
Open accessThe DOI matches its Crossref record.
Abstract
It has argued that systems for detecting similarities in submitted programs must be based on the analysis of program structure. One such system is “Plague”. In this paper, some difficulties with the Plague system are outlined and a new system is described that achieves the same goals as Plague, but in a way that is both more portable and more easily customized to new target languages.
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.
Integrity signals
Registry
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.
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
Cited by
Identifying similar code with program dependence graphs
Krinke, J. (2002) · Proceedings Eighth Working Conference on Reverse Engineering · doi:10.1109/wcre.2001.957835 · Cited by 616
Finding Plagiarisms among a Set of Programs with JPlag
Malpohl, G., Prechelt, L., & Philippsen, M. (2002) · Verlag der Technischen Universität Graz · doi:10.3217/jucs-008-11-1016 · Cited by 56
Methods for identifying versioned and plagiarized documents
Hoad, T. C., & Zobel, J. (2003) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.10170 · Cited by 330
Plagiarism in programming assignments
Joy, M., & Luck, M. (1999) · IEEE Transactions on Education · doi:10.1109/13.762946 · Cited by 299
YAP3: improved detection of similarities in computer program and other texts
Wise, M. J. (1996) · Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education · doi:10.1145/236452.236525 · Cited by 294
Self-citationJPlag: finding plagiarisms among a set of programs
Prechelt, L., Malpohl, G., & Philippsen, M. (2000) · Karlsruhe · doi:10.5445/ir/542000 · Cited by 144
“The email service of MOSS is roughly comparable, but nothing similar is available for YAP3.”
BackgroundResultInfluentialA comparison of code similarity analysers
Ragkhitwetsagul, C., Krinke, J., & Clark, D. (2018) · Empirical Software Engineering · doi:10.1007/s10664-017-9564-7 · Cited by 122
“One of the widely-used string similarity methods is to find a longest common subsequence (LCS) which is adopted by the NiCad clone detector (Roy and Cordy 2008), Plague (Whale 1990), the first version of YAP (Wise 1992), and CoP (Luo et al. 2014).”
MethodSource-code Similarity Detection and Detection Tools Used in Academia: A Systematic Review
Novak, M., Joy, M., & Kermek, D. (2019) · ACM Transactions on Computing Education · doi:10.1145/3313290 · Cited by 117
Automatic Source Code Plagiarism Detection
Kustanto, C., & Liem, I. (2009) · 2009 10th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computing · doi:10.1109/snpd.2009.62 · Cited by 58
Plagiarism Detection: A Tool Survey and Comparison
Martins, V. T., Fonte, D., Henriques, P. R., & da Cruz, D. (2014) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/oasics.slate.2014.143 · Cited by 53
Karnalim, O. (2016) · 2016 International Conference on Information & Communication Technology and Systems (ICTS) · doi:10.1109/icts.2016.7910274 · Cited by 46
“[25] M. J. Wise, "Detection of similarities in student programs: YAP'ing may be preferable to plague'ing," in Proceedings of the twenty-third SIGCSE technical symposium on Computer science education, New York, 1992.”
MethodInfluentialDesktop Tools for Offline Plagiarism Detection in Computer Programs
MOZGOVOY, M. (2006) · Informatics in Education · doi:10.15388/infedu.2006.08 · Cited by 46
“The complexity of the Brass algorithm has not yet been analyzed, but it is reasonable to suppose it is not faster than YAP3/JPlag systems.”
MethodInfluentialDetecting and tracing plagiarized documents by reconstruction plagiarism-evolution tree
Ryu, C.-K., Kim, H.-J., Ji, S.-H., Woo, G., & Cho, H.-G. (2008) · 2008 8th IEEE International Conference on Computer and Information Technology · doi:10.1109/cit.2008.4594660 · Cited by 16
Metadata
- Authors
- Wise, M. J.
- Venue
- Proceedings of the twenty-third SIGCSE technical symposium on Computer science education
- Publisher
- ACM
- Published
- 1992-03
- Pages
- 268-271
- OpenAlex
- W2060613917
- Cited by
- 87
- References
- 0
- FWCI
- 1.93
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
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.