{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T22:02:40Z","timestamp":1768687360200,"version":"3.49.0"},"reference-count":49,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,12,17]],"date-time":"2020-12-17T00:00:00Z","timestamp":1608163200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Education Ministry Humanities and Social Science Research Youth Fund Project of China","award":["19YJCZH240"],"award-info":[{"award-number":["19YJCZH240"]}]},{"name":"Education Ministry Humanities and Social Science Research Youth Fund Project of China","award":["QDSKL1901123"],"award-info":[{"award-number":["QDSKL1901123"]}]},{"name":"Education Ministry Humanities and Social Science Research Youth Fund Project of China","award":["61902222"],"award-info":[{"award-number":["61902222"]}]},{"name":"Education Ministry Humanities and Social Science Research Youth Fund Project of China","award":["U1931207"],"award-info":[{"award-number":["U1931207"]}]},{"name":"Education Ministry Humanities and Social Science Research Youth Fund Project of China","award":["tsqn201909109"],"award-info":[{"award-number":["tsqn201909109"]}]},{"name":"Education Ministry Humanities and Social Science Research Youth Fund Project of China","award":["ts20190936"],"award-info":[{"award-number":["ts20190936"]}]},{"name":"Education Ministry Humanities and Social Science Research Youth Fund Project of China","award":["2015TDJH102"],"award-info":[{"award-number":["2015TDJH102"]}]},{"name":"Education Ministry Humanities and Social Science Research Youth Fund Project of China","award":["JXTD20180503"],"award-info":[{"award-number":["JXTD20180503"]}]},{"name":"Qingdao Social Science Planning Research Project","award":["19YJCZH240"],"award-info":[{"award-number":["19YJCZH240"]}]},{"name":"Qingdao Social Science Planning Research Project","award":["QDSKL1901123"],"award-info":[{"award-number":["QDSKL1901123"]}]},{"name":"Qingdao Social Science Planning Research Project","award":["61902222"],"award-info":[{"award-number":["61902222"]}]},{"name":"Qingdao Social Science Planning Research Project","award":["U1931207"],"award-info":[{"award-number":["U1931207"]}]},{"name":"Qingdao Social Science Planning Research Project","award":["tsqn201909109"],"award-info":[{"award-number":["tsqn201909109"]}]},{"name":"Qingdao Social Science Planning Research Project","award":["ts20190936"],"award-info":[{"award-number":["ts20190936"]}]},{"name":"Qingdao Social Science Planning Research Project","award":["2015TDJH102"],"award-info":[{"award-number":["2015TDJH102"]}]},{"name":"Qingdao Social Science Planning Research Project","award":["JXTD20180503"],"award-info":[{"award-number":["JXTD20180503"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["19YJCZH240"],"award-info":[{"award-number":["19YJCZH240"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["QDSKL1901123"],"award-info":[{"award-number":["QDSKL1901123"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902222"],"award-info":[{"award-number":["61902222"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1931207"],"award-info":[{"award-number":["U1931207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["tsqn201909109"],"award-info":[{"award-number":["tsqn201909109"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["ts20190936"],"award-info":[{"award-number":["ts20190936"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2015TDJH102"],"award-info":[{"award-number":["2015TDJH102"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["JXTD20180503"],"award-info":[{"award-number":["JXTD20180503"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010040","name":"Taishan Scholar Project of Shandong Province","doi-asserted-by":"publisher","award":["19YJCZH240"],"award-info":[{"award-number":["19YJCZH240"]}],"id":[{"id":"10.13039\/501100010040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010040","name":"Taishan Scholar Project of Shandong Province","doi-asserted-by":"publisher","award":["QDSKL1901123"],"award-info":[{"award-number":["QDSKL1901123"]}],"id":[{"id":"10.13039\/501100010040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010040","name":"Taishan Scholar Project of Shandong Province","doi-asserted-by":"publisher","award":["61902222"],"award-info":[{"award-number":["61902222"]}],"id":[{"id":"10.13039\/501100010040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010040","name":"Taishan Scholar Project of Shandong Province","doi-asserted-by":"publisher","award":["U1931207"],"award-info":[{"award-number":["U1931207"]}],"id":[{"id":"10.13039\/501100010040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010040","name":"Taishan Scholar Project of Shandong Province","doi-asserted-by":"publisher","award":["tsqn201909109"],"award-info":[{"award-number":["tsqn201909109"]}],"id":[{"id":"10.13039\/501100010040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010040","name":"Taishan Scholar Project of Shandong Province","doi-asserted-by":"publisher","award":["ts20190936"],"award-info":[{"award-number":["ts20190936"]}],"id":[{"id":"10.13039\/501100010040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010040","name":"Taishan Scholar Project of Shandong Province","doi-asserted-by":"publisher","award":["2015TDJH102"],"award-info":[{"award-number":["2015TDJH102"]}],"id":[{"id":"10.13039\/501100010040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010040","name":"Taishan Scholar Project of Shandong Province","doi-asserted-by":"publisher","award":["JXTD20180503"],"award-info":[{"award-number":["JXTD20180503"]}],"id":[{"id":"10.13039\/501100010040","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004295","name":"Shandong University of Science and Technology","doi-asserted-by":"publisher","award":["19YJCZH240"],"award-info":[{"award-number":["19YJCZH240"]}],"id":[{"id":"10.13039\/501100004295","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004295","name":"Shandong University of Science and Technology","doi-asserted-by":"publisher","award":["QDSKL1901123"],"award-info":[{"award-number":["QDSKL1901123"]}],"id":[{"id":"10.13039\/501100004295","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004295","name":"Shandong University of Science and Technology","doi-asserted-by":"publisher","award":["61902222"],"award-info":[{"award-number":["61902222"]}],"id":[{"id":"10.13039\/501100004295","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004295","name":"Shandong University of Science and Technology","doi-asserted-by":"publisher","award":["U1931207"],"award-info":[{"award-number":["U1931207"]}],"id":[{"id":"10.13039\/501100004295","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004295","name":"Shandong University of Science and Technology","doi-asserted-by":"publisher","award":["tsqn201909109"],"award-info":[{"award-number":["tsqn201909109"]}],"id":[{"id":"10.13039\/501100004295","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004295","name":"Shandong University of Science and Technology","doi-asserted-by":"publisher","award":["ts20190936"],"award-info":[{"award-number":["ts20190936"]}],"id":[{"id":"10.13039\/501100004295","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004295","name":"Shandong University of Science and Technology","doi-asserted-by":"publisher","award":["2015TDJH102"],"award-info":[{"award-number":["2015TDJH102"]}],"id":[{"id":"10.13039\/501100004295","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004295","name":"Shandong University of Science and Technology","doi-asserted-by":"publisher","award":["JXTD20180503"],"award-info":[{"award-number":["JXTD20180503"]}],"id":[{"id":"10.13039\/501100004295","id-type":"DOI","asserted-by":"publisher"}]},{"name":"SDUST Excellent Teaching Team Construction Plan","award":["19YJCZH240"],"award-info":[{"award-number":["19YJCZH240"]}]},{"name":"SDUST Excellent Teaching Team Construction Plan","award":["QDSKL1901123"],"award-info":[{"award-number":["QDSKL1901123"]}]},{"name":"SDUST Excellent Teaching Team Construction Plan","award":["61902222"],"award-info":[{"award-number":["61902222"]}]},{"name":"SDUST Excellent Teaching Team Construction Plan","award":["U1931207"],"award-info":[{"award-number":["U1931207"]}]},{"name":"SDUST Excellent Teaching Team Construction Plan","award":["tsqn201909109"],"award-info":[{"award-number":["tsqn201909109"]}]},{"name":"SDUST Excellent Teaching Team Construction Plan","award":["ts20190936"],"award-info":[{"award-number":["ts20190936"]}]},{"name":"SDUST Excellent Teaching Team Construction Plan","award":["2015TDJH102"],"award-info":[{"award-number":["2015TDJH102"]}]},{"name":"SDUST Excellent Teaching Team Construction Plan","award":["JXTD20180503"],"award-info":[{"award-number":["JXTD20180503"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2020,12,17]]},"abstract":"<jats:p>Source code similarity detection has various applications in code plagiarism detection and software intellectual property protection. In computer programming teaching, students may convert the source code written in one programming language into another language for their code assignment submission. Existing similarity measures of source code written in the same language are not applicable for the cross-language code similarity detection because of syntactic differences among different programming languages. Meanwhile, existing cross-language source similarity detection approaches are susceptible to complex code obfuscation techniques, such as replacing equivalent control structure and adding redundant statements. To solve this problem, we propose a cross-language code similarity detection (CLCSD) approach based on code flowcharts. In general, two source code fragments written in different programming languages are transformed into standardized code flowcharts (SCFC), and their similarity is obtained by measuring their corresponding SCFC. More specifically, we first introduce the standardized code flowchart (SCFC) model to be the uniform flowcharts representation of source code written in different languages. SCFC is language-independent, and therefore, it can be used as the intermediate structure for source code similarity detection. Meanwhile, transformation techniques are given to transform source code written in a specific programming language into an SCFC. Second, we propose the SCFC-SPGK algorithm based on the shortest path graph kernel to measure the similarity between two SCFCs. Thus, the similarity between two pieces of source code in different programming languages is given by the similarity between SCFCs. Experimental results show that compared with existing approaches, CLCSD has higher accuracy in cross-language source code similarity detection. Furthermore, CLCSD cannot only handle common source code obfuscation techniques used by students in computer programming teaching but also obtain nearly 90% accuracy in dealing with some complex obfuscation techniques.<\/jats:p>","DOI":"10.1155\/2020\/8835310","type":"journal-article","created":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T18:20:34Z","timestamp":1608315634000},"page":"1-15","source":"Crossref","is-referenced-by-count":3,"title":["Flowchart-Based Cross-Language Source Code Similarity Detection"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2646-9854","authenticated-orcid":true,"given":"Feng","family":"Zhang","sequence":"first","affiliation":[{"name":"College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China"},{"name":"Shandong Key Laboratory of Wisdom Mine Information Technology, Qingdao 266590, China"}]},{"given":"Guofan","family":"Li","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2665-7153","authenticated-orcid":true,"given":"Cong","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University of Technology, Zibo 255000, China"}]},{"given":"Qian","family":"Song","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Shandong University of Science and Technology, Qingdao 266590, China"}]}],"member":"311","reference":[{"key":"1","first-page":"363","article-title":"Neural network-based graph embedding for cross-platform binary code similarity detection","author":"X. Xu"},{"key":"2","first-page":"34","article-title":"Plagiarism detection using feature-based neural networks","author":"S. Engels"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxh119"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/3143560"},{"key":"5","first-page":"512","article-title":"LICCA: a tool for cross-language clone detection","author":"T. Vislavski"},{"key":"6","first-page":"253","article-title":"Metrics based plagarism monitoring","author":"E. L. Jones","year":"2001","journal-title":"Journal of Computing Sciences in Colleges"},{"issue":"4","key":"7","first-page":"962","article-title":"Code clone detection: a literature review","volume":"30","author":"Q. Y. Chen","year":"2019","journal-title":"Journal of Software"},{"key":"8","first-page":"301","article-title":"Identifying similar code with program dependence graphs","author":"J. Krinke"},{"key":"9","first-page":"74","article-title":"Shortest-path kernels on graphs","author":"K. M. Borgwardt"},{"key":"10","first-page":"86","article-title":"On finding duplication and near duplication in large software systems","author":"B. S. Baker"},{"key":"11","first-page":"39","article-title":"CPDP: a robust technique for plagiarism detection in source code","author":"B. Muddu"},{"issue":"2","key":"12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/spe.750","article-title":"Efficient plagiarism detection for large code repositories","volume":"37","author":"S. Burrows","year":"2006","journal-title":"Software Practice and Experience"},{"issue":"11","key":"13","first-page":"1016","article-title":"Finding plagiarisms among a set of programs with JPlag","volume":"8","author":"L. Prechelt","year":"2002","journal-title":"Journal of Universal Computer Science"},{"key":"14","first-page":"1000","article-title":"Program plagiarism detection using parse tree kernels","author":"J. W. Son"},{"key":"15","first-page":"48","article-title":"Syntax trees and information retrieval to improve code similarity detection","author":"K. Oscar"},{"issue":"4","key":"16","first-page":"1660","article-title":"AST-based plagiarism detection method","volume":"33","author":"Z. Liping","year":"2012","journal-title":"Computer Engineering and Design"},{"key":"17","first-page":"1","article-title":"Source code plagiarism detecting method using alignment with abstract syntax tree elements","author":"H. Kikuchi"},{"key":"18","first-page":"714","article-title":"Improved plagiarism detection algorithm based on abstract syntax tree","author":"T. Guo"},{"key":"19","first-page":"321","article-title":"Scalable detection of semantic clones","author":"M. Gabel"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2009.04.011"},{"key":"21","first-page":"872","article-title":"GPLAG: detection of software plagiarism by program dependence graph analysis","author":"C. Liu"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1142\/s0218194015500229"},{"key":"23","first-page":"40","article-title":"Using slicing to identify duplication in source code","author":"R. Komondoor"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/tse.2002.1019480"},{"key":"25","first-page":"277","article-title":"Plagiarism detection across programming languages","author":"C. Arwin"},{"key":"26","first-page":"405","article-title":"Detecting clones across microsoft. net programming languages","author":"F. Al-Omari"},{"key":"27","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-030-16722-6_14","article-title":"Structural and nominal cross-language clone detection","volume-title":"Fundamental Approaches to Software Engineering, FASE","author":"L. Nichols","year":"2019"},{"key":"28","first-page":"518","article-title":"Cross-language clone detection by learning over abstract syntax trees","author":"D. Perez"},{"key":"29","first-page":"54","article-title":"Cross-Language clone detection","author":"N. A. Kraft"},{"key":"30","first-page":"1026","article-title":"CLCDSA: cross Language code clone detection using syntactical features and API documentation","author":"K. W. Nafi"},{"key":"31","first-page":"1","article-title":"DeSoCoRe: detecting source code re-use across programming languages","author":"E. Flores"},{"issue":"13","key":"32","first-page":"1708","article-title":"cross-language source code Re-use detection using latent semantic analysis","volume":"21","author":"E. Flores","year":"2015","journal-title":"Journal of Universal Computer Science"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2016edp7334"},{"key":"34","article-title":"Software plagiarism detection in multiprogramming languages using machine learning approach","author":"F. Ullah","year":"2018","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"35","volume-title":"Research on Cross-Language Code Similarity Detection Method Based on Program Flow Chart","author":"Q. Song","year":"2019"},{"key":"36","first-page":"163","volume-title":"Fast Suboptimal Algorithms for the Computation of Graph Edit Distance","author":"M. Neuhaus","year":"2006"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2010.239"},{"key":"38","first-page":"379","article-title":"Tree similarity measurement for classifying questions by syntactic structures","author":"Z. Lin"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1016\/j.indag.2014.04.010"},{"key":"40","first-page":"828","article-title":"Fast random walk graph kernel","author":"U. Kang"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2012.07.017"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"43","first-page":"70","article-title":"Extensions of marginalized graph kernels","author":"P. Mahe"},{"issue":"2","key":"44","first-page":"1201","article-title":"Graph kernels","volume":"9","author":"S. V. N. Vishwanathan","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1002\/cae.21608"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1145\/3313290"},{"key":"48","doi-asserted-by":"publisher","DOI":"10.1109\/tse.2015.2454508"},{"key":"49","doi-asserted-by":"publisher","DOI":"10.1109\/tsc.2016.2617331"}],"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2020\/8835310.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2020\/8835310.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2020\/8835310.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T18:20:54Z","timestamp":1608315654000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/sp\/2020\/8835310\/"}},"subtitle":[],"editor":[{"given":"Jianping","family":"Gou","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,12,17]]},"references-count":49,"alternative-id":["8835310","8835310"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8835310","relation":{},"ISSN":["1875-919X","1058-9244"],"issn-type":[{"value":"1875-919X","type":"electronic"},{"value":"1058-9244","type":"print"}],"subject":[],"published":{"date-parts":[[2020,12,17]]}}}