IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i2p461-d1036703.html
   My bibliography  Save this article

Deep Forest and Pruned Syntax Tree-Based Classification Method for Java Code Vulnerability

Author

Listed:
  • Jiaman Ding

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China
    Artificial Intelligence Key Laboratory of Yunnan Province, Kunming University of Science and Technology, Kunming 650500, China)

  • Weikang Fu

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China
    Artificial Intelligence Key Laboratory of Yunnan Province, Kunming University of Science and Technology, Kunming 650500, China)

  • Lianyin Jia

    (Faculty of Information Engineering and Automation, Kunming University of Science and Technology, Kunming 650500, China
    Artificial Intelligence Key Laboratory of Yunnan Province, Kunming University of Science and Technology, Kunming 650500, China)

Abstract

The rapid development of J2EE (Java 2 Platform Enterprise Edition) has brought unprecedented severe challenges to vulnerability mining. The current abstract syntax tree-based source code vulnerability classification method does not eliminate irrelevant nodes when processing the abstract syntax tree, resulting in a long training time and overfitting problems. Another problem is that different code structures will be translated to the same sequence of tree nodes when processing abstract syntax trees using depth-first traversal, so in this process, the depth-first algorithm will lead to the loss of semantic structure information which will reduce the accuracy of the model. Aiming at these two problems, we propose a deep forest and pruned syntax tree-based classification method (PSTDF) for Java code vulnerability. First, the breadth-first traversal of the abstract syntax tree obtains the sequence of statement trees, next, pruning statement trees removes irrelevant nodes, then we use a depth-first based encoder to obtain the vector, and finally, we use deep forest as the classifier to get classification results. Experiments on publicly accessible vulnerability datasets show that PSTDF can reduce the loss of semantic structure information and effectively remove the impact of redundant information.

Suggested Citation

  • Jiaman Ding & Weikang Fu & Lianyin Jia, 2023. "Deep Forest and Pruned Syntax Tree-Based Classification Method for Java Code Vulnerability," Mathematics, MDPI, vol. 11(2), pages 1-18, January.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:2:p:461-:d:1036703
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/2/461/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/2/461/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yao Meng & Long Liu, 2020. "A Deep Learning Approach for a Source Code Detection Model Using Self-Attention," Complexity, Hindawi, vol. 2020, pages 1-15, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:2:p:461-:d:1036703. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.