Keep It Simple: Towards Accurate Vulnerability Detection for Large Code Graphs
Xin Peng, Shangwen Wang, Yihao Qin, Bo Lin, Liqian Chen, Xiaoguang Mao

TL;DR
This paper introduces ANGLE, a novel method combining hierarchical graph refinement and context-aware learning to improve vulnerability detection in large code graphs, significantly outperforming existing approaches.
Contribution
The paper presents ANGLE, a new approach that effectively filters noise and captures long-distance dependencies in code graphs for vulnerability detection.
Findings
ANGLE outperforms baselines in accuracy and F1 score.
Significant improvements in large code graphs, up to 161.93%.
Effective hierarchical filtering reduces graph size and noise.
Abstract
Software vulnerability detection is crucial for high-quality software development. Recently, some studies utilizing Graph Neural Networks (GNNs) to learn the graph representation of code in vulnerability detection tasks have achieved remarkable success. However, existing graph-based approaches mainly face two limitations that prevent them from generalizing well to large code graphs: (1) the interference of noise information in the code graph; (2) the difficulty in capturing long-distance dependencies within the graph. To mitigate these problems, we propose a novel vulnerability detection method, ANGLE, whose novelty mainly embodies the hierarchical graph refinement and context-aware graph representation learning. The former hierarchically filters redundant information in the code graph, thereby reducing the size of the graph, while the latter collaboratively employs the Graph…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
