Code Aggregate Graph: Effective Representation for Graph Neural Networks to Detect Vulnerable Code

被引:0
|
作者
Nguyen, Hoang Viet [1 ]
Zheng, Junjun [2 ]
Inomata, Atsuo [2 ]
Uehara, Tetsutaro [1 ]
机构
[1] Ritsumeikan University, College of Information Science and Engineering, Kusatsu,5258577, Japan
[2] Osaka University, Graduate School of Information Science and Technology, Osaka,5650871, Japan
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Deep learning, especially graph neural networks (GNNs), provides efficient, fast, and automated methods to detect vulnerable code. However, the accuracy could be improved as previous studies were limited by existing code representations. Additionally, the diversity of embedding techniques and GNN models can make selecting the appropriate method challenging. Herein we propose Code Aggregate Graph (CAG) to improve vulnerability detection efficiency. CAG combines the principles of different code analyses such as abstract syntax tree, control flow graph, and program dependence graph with dominator and post-dominator trees. This extensive representation empowers deep graph networks for enhanced classification. We also implement different data encoding methods and neural networks to provide a multidimensional view of the system performance. Specifically, three word embedding approaches and three deep GNNs are utilized to build classifiers. Then CAG is evaluated using two datasets: a real-world open-source dataset and the software assurance reference dataset. CAG is also compared with seven state-of-the-art methods and six classic representations. CAG shows the best performance. Compared to previous studies, CAG has an increased accuracy (5.4%) and F1-score (5.1%). Additionally, experiments confirm that encoding has a positive impact on accuracy (4-6%) but the network type does not. The study should contribute to a meaningful benchmark for future research on code representations, data encoding, and GNNs. © 2013 IEEE.
引用
收藏
页码:123786 / 123800
相关论文
共 50 条
  • [41] Graph Rewiring and Preprocessing for Graph Neural Networks Based on Effective Resistance
    Shen, Xu
    Lio, Pietro
    Yang, Lintao
    Yuan, Ru
    Zhang, Yuyang
    Peng, Chengbin
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (11) : 6330 - 6343
  • [42] GRAPH ASSOCIATED WITH LINEAR CODE
    GUO, F
    WATANABE, Y
    IEICE TRANSACTIONS ON COMMUNICATIONS ELECTRONICS INFORMATION AND SYSTEMS, 1991, 74 (01): : 49 - 53
  • [43] Code graph for malware detection
    Jeong, Kyoochang
    Lee, Heejo
    2008 THE INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING, 2008, : 137 - +
  • [44] MAXIMALITY OF THE CYCLE CODE OF A GRAPH
    SOLE, P
    ZASLAVSKY, T
    DISCRETE MATHEMATICS, 1994, 128 (1-3) : 401 - 405
  • [45] Graph Code Based Isomorphism Query on Graph Data
    Hlaing, Yu Wai
    Oo, Kyaw May
    2015 IEEE INTERNATIONAL CONFERENCE ON SMART CITY/SOCIALCOM/SUSTAINCOM (SMARTCITY), 2015, : 709 - 714
  • [46] Identifying code for directed graph
    Xu, Yi-Chun
    Xiao, Ren-Bin
    SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 2, PROCEEDINGS, 2007, : 97 - +
  • [47] ASSOCIATIVE DIGITAL NEURAL NETWORK BASED ON CODE AND GRAPH THEORIES
    TANAKA, M
    TAKEYA, K
    KANAYA, M
    CHIGUSA, Y
    1989 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-3, 1989, : 2193 - 2196
  • [48] Efficient graph representation in graph neural networks for stress predictions in stiffened panels
    Cai, Yuecheng
    Jelovica, Jasmin
    THIN-WALLED STRUCTURES, 2024, 203
  • [49] TANGNN: A concise, scalable and effective graph neural networks with Top-m attention mechanism for graph representation learning
    E, Jiawei
    Zhang, Yinglong
    Xia, Xuewen
    Xu, Xing
    EXPERT SYSTEMS WITH APPLICATIONS, 2025, 271
  • [50] Vulnerability Detection via Multiple-Graph-Based Code Representation
    Qiu, Fangcheng
    Liu, Zhongxin
    Hu, Xing
    Xia, Xin
    Chen, Gang
    Wang, Xinyu
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2024, 50 (08) : 2178 - 2199