Duplicate and Plagiarism Search in Program Code Using Suffix Trees over Compiled Code

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • Additional Information
    • Publication Information:
      FRUCT
    • Publication Date:
      2020
    • Abstract:
      The search for duplicate source code allow both to improve the quality of the software being developed and to detect plagiarism. In this paper, it is proposed to use a set of features of modern optimizing compilers to simplify and reduce this task to a search by similarity of text fragments. In this case, many types of cosmetic changes in code do not affect the search result. In order to effectively search by similarity, we use sparse suffix trees built on binary encoded data. Algorithms for constructing such a tree and performing a search are presented. The application of the results to detect cheating in a distance programming workshop is described.
    • Contents Note:
      Conference Acronym: FRUCT
    • Author Affiliations:
      Vologda State University,Vologda,Russia
    • ISBN:
      978-952-69244-2-7
    • ISSN:
      2305-7254
    • Relation:
      2020 26th Conference of Open Innovations Association (FRUCT)
    • Accession Number:
      10.23919/FRUCT48808.2020.9087465
    • Rights:
      Copyright 2020, FRUCT
    • AMSID:
      9087465
    • Conference Acronym:
      FRUCT
    • Date of Current Version:
      2020
    • Document Subtype:
      IEEE Conference
    • Notes:
      Conference Location: Yaroslavl, Russia, Russia

      Conference Start Date: 20 April 2020

      Conference End Date: 24 April 2020
    • Accession Number:
      edseee.9087465
  • Citations
    • ABNT:
      ANDRIANOV, I. et al. Duplicate and Plagiarism Search in Program Code Using Suffix Trees over Compiled Code. 2020 26th Conference of Open Innovations Association (FRUCT), Open Innovations Association (FRUCT), 2020 26th Conference of, [s. l.], p. 1–7, 2020. DOI 10.23919/FRUCT48808.2020.9087465. Disponível em: http://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edseee&AN=edseee.9087465. Acesso em: 14 ago. 2020.
    • AMA:
      Andrianov I, Rzheutskaya S, Sukonschikov A, Kochkin D, Shvetsov A, Sorokin A. Duplicate and Plagiarism Search in Program Code Using Suffix Trees over Compiled Code. 2020 26th Conference of Open Innovations Association (FRUCT), Open Innovations Association (FRUCT), 2020 26th Conference of. April 2020:1-7. doi:10.23919/FRUCT48808.2020.9087465
    • APA:
      Andrianov, I., Rzheutskaya, S., Sukonschikov, A., Kochkin, D., Shvetsov, A., & Sorokin, A. (2020). Duplicate and Plagiarism Search in Program Code Using Suffix Trees over Compiled Code. 2020 26th Conference of Open Innovations Association (FRUCT), Open Innovations Association (FRUCT), 2020 26th Conference Of, 1–7. https://doi.org/10.23919/FRUCT48808.2020.9087465
    • Chicago/Turabian: Author-Date:
      Andrianov, Igor, Svetlana Rzheutskaya, Alexey Sukonschikov, Dmitry Kochkin, Anatoly Shvetsov, and Arseny Sorokin. 2020. “Duplicate and Plagiarism Search in Program Code Using Suffix Trees over Compiled Code.” 2020 26th Conference of Open Innovations Association (FRUCT), Open Innovations Association (FRUCT), 2020 26th Conference Of, April, 1–7. doi:10.23919/FRUCT48808.2020.9087465.
    • Harvard:
      Andrianov, I. et al. (2020) ‘Duplicate and Plagiarism Search in Program Code Using Suffix Trees over Compiled Code’, 2020 26th Conference of Open Innovations Association (FRUCT), Open Innovations Association (FRUCT), 2020 26th Conference of, pp. 1–7. doi: 10.23919/FRUCT48808.2020.9087465.
    • Harvard: Australian:
      Andrianov, I, Rzheutskaya, S, Sukonschikov, A, Kochkin, D, Shvetsov, A & Sorokin, A 2020, ‘Duplicate and Plagiarism Search in Program Code Using Suffix Trees over Compiled Code’, 2020 26th Conference of Open Innovations Association (FRUCT), Open Innovations Association (FRUCT), 2020 26th Conference of, pp. 1–7, viewed 14 August 2020, .
    • MLA:
      Andrianov, Igor, et al. “Duplicate and Plagiarism Search in Program Code Using Suffix Trees over Compiled Code.” 2020 26th Conference of Open Innovations Association (FRUCT), Open Innovations Association (FRUCT), 2020 26th Conference Of, Apr. 2020, pp. 1–7. EBSCOhost, doi:10.23919/FRUCT48808.2020.9087465.
    • Chicago/Turabian: Humanities:
      Andrianov, Igor, Svetlana Rzheutskaya, Alexey Sukonschikov, Dmitry Kochkin, Anatoly Shvetsov, and Arseny Sorokin. “Duplicate and Plagiarism Search in Program Code Using Suffix Trees over Compiled Code.” 2020 26th Conference of Open Innovations Association (FRUCT), Open Innovations Association (FRUCT), 2020 26th Conference Of, April 1, 2020, 1–7. doi:10.23919/FRUCT48808.2020.9087465.
    • Vancouver/ICMJE:
      Andrianov I, Rzheutskaya S, Sukonschikov A, Kochkin D, Shvetsov A, Sorokin A. Duplicate and Plagiarism Search in Program Code Using Suffix Trees over Compiled Code. 2020 26th Conference of Open Innovations Association (FRUCT), Open Innovations Association (FRUCT), 2020 26th Conference of [Internet]. 2020 Apr 1 [cited 2020 Aug 14];1–7. Available from: http://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edseee&AN=edseee.9087465