TY - GEN
T1 - Adaptive Graph Contrastive Learning for Blockchain Smart Contract Vulnerability Detection
AU - Zhou, Junjie
AU - Zhao, Xiangguo
AU - Yao, Xin
AU - Bi, Xin
AU - Yuan, Ye
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2026.
PY - 2026
Y1 - 2026
N2 - Detecting vulnerabilities in smart contracts is essential for ensuring the security and reliability of blockchain applications. However, existing graph neural network based methods often rely on expert-crafted features or function call surfaces. And the long-tail distribution in vulnerability datasets causes biased learning toward majority classes. Contrastive learning has been explored as a way to alleviate this issue. But existing augmentation strategies often introduce noise in contrastive learning, degrading representation quality. To address these issues, we propose the Adaptive Graph Contrastive Learning (AGCL) framework. AGCL utilizes the unsupervised multi-level structural attention (UMSA) mechanism to extract the similarity between nodes from semantic, structure and nested function calls. It includes mask degree-free GCN (MDR-GCN) and harmonic distance loss (HDL) to improve the separation between positive and negative representations. Experimental results on ESC and VSC datasets for Reentrancy and Infinite Loop detection surpasses the existing SOTA methods. This performance gain is achieved with full consideration of complex code, such as semantic, structure and nested function calls.
AB - Detecting vulnerabilities in smart contracts is essential for ensuring the security and reliability of blockchain applications. However, existing graph neural network based methods often rely on expert-crafted features or function call surfaces. And the long-tail distribution in vulnerability datasets causes biased learning toward majority classes. Contrastive learning has been explored as a way to alleviate this issue. But existing augmentation strategies often introduce noise in contrastive learning, degrading representation quality. To address these issues, we propose the Adaptive Graph Contrastive Learning (AGCL) framework. AGCL utilizes the unsupervised multi-level structural attention (UMSA) mechanism to extract the similarity between nodes from semantic, structure and nested function calls. It includes mask degree-free GCN (MDR-GCN) and harmonic distance loss (HDL) to improve the separation between positive and negative representations. Experimental results on ESC and VSC datasets for Reentrancy and Infinite Loop detection surpasses the existing SOTA methods. This performance gain is achieved with full consideration of complex code, such as semantic, structure and nested function calls.
KW - Adaptive graph augmentation
KW - Blockchain smart contract vulnerability detection
KW - Graph contrastive learning
KW - Graph representation learning
UR - https://www.scopus.com/pages/publications/105029882898
U2 - 10.1007/978-981-95-5719-6_35
DO - 10.1007/978-981-95-5719-6_35
M3 - Conference contribution
AN - SCOPUS:105029882898
SN - 9789819557189
T3 - Lecture Notes in Computer Science
SP - 549
EP - 563
BT - Web and Big Data - 9th International Joint Conference, APWeb-WAIM 2025, Proceedings
A2 - Li, Jiajia
A2 - Zong, Chuanyu
A2 - Chbeir, Richard
A2 - Li, Lei
A2 - Zhang, Yanfeng
A2 - Zhang, Mengxuan
PB - Springer Science and Business Media Deutschland GmbH
T2 - 9th Asia-Pacific Web and Web-Age Information Management Joint International Conference on Web and Big Data, APWeb-WAIM 2025
Y2 - 28 August 2025 through 30 August 2025
ER -