{"title":"A Duplicate Code Checking Algorithm for the Programming Experiment","authors":"Haoxin Wang, Jingdong Zhong, Defu Zhang","doi":"10.1109/MCSI.2015.12","DOIUrl":null,"url":null,"abstract":"Recent years have witnessed a growing-number of plagiarism in the IT circle with the fast-developing Internet technology and an industry of software piracy is also simmering beneath the surface. There is no doubt that the plagiarists' behaviors belong to intellectual property infringement. So bad is the consequence that the plagiarism identification is drawing more and more attention from the public nowadays. Based on the longest common subsequence seeking algorithm, this paper develops a dynamic programming to solve the duplicate code checking problem and puts forward a new method to measure the program code similarity. Compared with other state-of-the-art LCS solutions, the proposed algorithm has higher efficiency and lower time complexity in most experimental cases.","PeriodicalId":371635,"journal":{"name":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MCSI.2015.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Recent years have witnessed a growing-number of plagiarism in the IT circle with the fast-developing Internet technology and an industry of software piracy is also simmering beneath the surface. There is no doubt that the plagiarists' behaviors belong to intellectual property infringement. So bad is the consequence that the plagiarism identification is drawing more and more attention from the public nowadays. Based on the longest common subsequence seeking algorithm, this paper develops a dynamic programming to solve the duplicate code checking problem and puts forward a new method to measure the program code similarity. Compared with other state-of-the-art LCS solutions, the proposed algorithm has higher efficiency and lower time complexity in most experimental cases.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
