一种基于令牌的非法复制检测方法,使用程序练习的复杂性

Mai Iwamoto, S. Oshima, T. Nakashima
{"title":"一种基于令牌的非法复制检测方法,使用程序练习的复杂性","authors":"Mai Iwamoto, S. Oshima, T. Nakashima","doi":"10.1109/BWCCA.2013.100","DOIUrl":null,"url":null,"abstract":"The conducts to copy using other person's source codes and submit as reports are regarded as a problem for program exercises of programming subjects in universities or colleges. An automatic detection algorithm to detect illicit copies is required in these educational organizations. In previous researches, these methods based on the detection standard of the token length have been proposed. These methods use the threshold simply using the character length. In these cases, miss detections occur in the case of the simple program such as the sequence of the print statement or the case that token sequences appear in the middle of a statement. This paper proposes the detection method using the program complexity and the complete token sequence. As the results of experiments, our method can improve the recall R adopting the complexity as the detection standard and the precision P adopting the complete token sequence for exercise programs submitted by students.","PeriodicalId":227978,"journal":{"name":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Token-based Illicit Copy Detection Method Using Complexity for a Program Exercise\",\"authors\":\"Mai Iwamoto, S. Oshima, T. Nakashima\",\"doi\":\"10.1109/BWCCA.2013.100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The conducts to copy using other person's source codes and submit as reports are regarded as a problem for program exercises of programming subjects in universities or colleges. An automatic detection algorithm to detect illicit copies is required in these educational organizations. In previous researches, these methods based on the detection standard of the token length have been proposed. These methods use the threshold simply using the character length. In these cases, miss detections occur in the case of the simple program such as the sequence of the print statement or the case that token sequences appear in the middle of a statement. This paper proposes the detection method using the program complexity and the complete token sequence. As the results of experiments, our method can improve the recall R adopting the complexity as the detection standard and the precision P adopting the complete token sequence for exercise programs submitted by students.\",\"PeriodicalId\":227978,\"journal\":{\"name\":\"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BWCCA.2013.100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BWCCA.2013.100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

复制使用他人源代码并作为报告提交的行为被认为是高校编程学科程序练习中的一个问题。这些教育机构需要一种自动检测算法来检测非法拷贝。在以往的研究中,已经提出了这些基于令牌长度检测标准的方法。这些方法仅使用字符长度来使用阈值。在这些情况下,遗漏检测发生在简单程序的情况下,例如打印语句的序列或标记序列出现在语句中间的情况。本文提出了一种基于程序复杂度和完整令牌序列的检测方法。实验结果表明,该方法可以提高学生提交的习题以复杂度为检测标准的查全率R和以完整token序列为检测标准的查全率P。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Token-based Illicit Copy Detection Method Using Complexity for a Program Exercise
The conducts to copy using other person's source codes and submit as reports are regarded as a problem for program exercises of programming subjects in universities or colleges. An automatic detection algorithm to detect illicit copies is required in these educational organizations. In previous researches, these methods based on the detection standard of the token length have been proposed. These methods use the threshold simply using the character length. In these cases, miss detections occur in the case of the simple program such as the sequence of the print statement or the case that token sequences appear in the middle of a statement. This paper proposes the detection method using the program complexity and the complete token sequence. As the results of experiments, our method can improve the recall R adopting the complexity as the detection standard and the precision P adopting the complete token sequence for exercise programs submitted by students.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信