Finding Plagiarisms among a Set of Programs with JPlag

Простая страница элемента
dc.creatorPrechelt,Lutz
dc.creatorMalpohl,Guido
dc.creatorPhilippsen,Michael
dc.date2002
dc.date.accessioned2024-02-06T12:52:02Z
dc.date.available2024-02-06T12:52:02Z
dc.descriptionJPlag is a web service that finds pairs of similar programs among a given set of programs. It has successfully been used in practice for detecting plagiarisms among student Java program submissions. Support for the languages C, C++ and Scheme is also available. We describe JPlag's architecture and its comparsion algorithm, which is based on a known one called Greedy String Tiling. Then, the contribution of this paper is threefold: First, an evaluation of JPlag's performance on several rather different sets of Java programs shows that JPlag is very hard to deceive. More than 90 percent of the 77 plagiarisms within our various benchmark program sets are reliably detected and a majority of the others at least raise suspicion. The run time is just a few seconds for submissions of 100 programs of several hundred lines each. Second, a parameter study shows that the approach is fairly robust with respect to its configuration parameters. Third, we study the kinds of attempts used for disguising plagiarisms, their frequency, and their success.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-008-11-1016
dc.identifierhttps://lib.jucs.org/article/27920/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/8243
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 8(11): 1016-1038
dc.subjectplagiarism
dc.subjectsimilarity
dc.subjectsearch
dc.subjecttoken
dc.subjectstring tiling
dc.titleFinding Plagiarisms among a Set of Programs with JPlag
dc.typeResearch Article
Файлы
Коллекции