Haifang Zhou

Haifang Zhou

Auto-generated profile, based on publicly available information

Haifang Zhou

National university of defense technology, Changsha, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 October 2023
Verified
Conference Paper
Open access
JDJingcan Duan
Jingcan Duan
PZPei Zhang
Pei Zhang
SWSiwei Wang
Siwei Wang
JHJingtao Hu
Jingtao Hu
HJHu Jin
Hu Jin
XLXinwang Liu
Xinwang Liu
Graph anomaly detection (GAD) has attracted increasing attention in machine learning and data mining. Recent works have mainly focused on how to capture richer information to improve the quality of node embeddings for GAD. Despite their significant advances in detection performance, there is still a relative dearth of research on the properties of the task. GAD aims to discern the anomalies that deviate from most nodes. However, the model is prone to learn the pattern of normal samples which make up the majority of samples. Meanwhile, anomalies can be easily detected when their behaviors differ from normality. Therefore, the performance can be further improved by enhancing the ability to learn the normal pattern. To this end, we propose a normality learning-based GAD framework via multi-scale contrastive learning networks (NLGAD for abbreviation). Specifically, we first initialize the model with the contrastive networks on different scales. To provide sufficient and reliable normal nodes for normality learning, we design an effective hybrid strategy for normality selection. Finally, the model is refined with the only input of reliable normal nodes and learns a more accurate estimate of normality so that anomalous nodes can be more easily distinguished. Eventually, extensive experiments on six benchmark graph datasets demonstrate the effectiveness of our normality learning-based scheme on GAD. Notably, the proposed algorithm improves the detection performance (up to 5.89% AUC gain) compared with the state-of-the-art methods. The source code is released at https://github.com/FelixDJC/NLGAD.

2 January 2026 in Neural Networks
Verified
Journal Article
Closed access
RZRuyi Zhang
Ruyi Zhang
HXHongzuo Xu
Hongzuo Xu
SJSonglei Jian
Songlei Jian
YTYusong Tan
Yusong Tan
HZHaifang Zhou
Haifang Zhou
RXRulin Xu
Rulin Xu

4 August 2023
Verified
Conference Paper
Open access
XHXiangbing Huang
Xiangbing Huang
YMYingwei Ma
Yingwei Ma
HZHaifang Zhou
Haifang Zhou
ZJZhijie Jiang
Zhijie Jiang
YZYuanliang Zhang
Yuanliang Zhang
SLShanshan Li
Shanshan Li

24 July 2024
Verified
Conference Paper
Open access
RXRulin Xu
Rulin Xu
LCLuohui Chen
Luohui Chen
RZRuyi Zhang
Ruyi Zhang
YZYuanliang Zhang
Yuanliang Zhang
WXWei Xiao
Wei Xiao
XMXiaoguang Mao
Xiaoguang Mao
High-precision static analysis can effectively detect Null Pointer Dereference (NPD) vulnerabilities in C language, but the performance overhead is significant. In recent years, researchers have attempted to enhance the efficiency of static analysis by leveraging multicore resources. However, due to complex dependencies in the analysis process, the parallelization of static value-flow NPD analysis for large-scale software still faces significant challenges. It is difficult to achieve a good balance between detection efficiency and accuracy, which impacts its application.This paper presents PANDA, the first parallel detector for high-precision static value-flow NPD analyzer in the C language. The core idea of PANDA is to utilize dependency analysis to ensure high precision while decoupling the strong dependencies between static value-flow analysis steps. This transforms the traditionally challenging-to-parallelize NPD analysis into two parallelizable algorithms: function summarization and combined query-based vulnerability analysis. PANDA introduces a task-level parallel framework and enhances it with a dynamic scheduling method to parallel schedule the above two key steps, significantly improving the performance and scalability of memory vulnerability detection.Fully implemented within the LLVM framework (version 15.0.7), PANDA demonstrates a significant advantage in balancing accuracy and efficiency compared to current popular open-source detection tools. In precision-targeted benchmark tests, PANDA maintains a false positive rate within 3.17% and a false negative rate within 5.16%; in historical CVE detection rate tests, its recall rate far exceeds that of comparative open-source tools. In performance evaluations, compared to its serial version, PANDA achieves up to an 11.23-fold speedup on a 16-node server, exhibiting outstanding scalability.

23 June 2025
Verified
Conference Paper
Open access
XLXingpei Li
Xingpei Li
ZJZhijie Jiang
Zhijie Jiang
ZJZhouyang Jia
Zhouyang Jia
YZYuanliang Zhang
Yuanliang Zhang
ZSZheng Si
Zheng Si
SLShanshan Li
Shanshan Li

10 July 2024
Verified
Conference Paper
Open access
HLHaoran Liu
Haoran Liu
ZJZhouyang Jia
Zhouyang Jia
HZHuiping Zhou
Huiping Zhou
HZHaifang Zhou
Haifang Zhou
SLShanshan Li
Shanshan Li
Error handling bugs are widespread in software, compromising its reliability. In C/C++ environments, error-handling bugs are often propagated to multiple functions through return values. This paper introduces EH-Fixer, a conversation-based automated method for fixing propagated error-handling (PEH) bugs. EH-Fixer employs LLM in a conversation style, utilizing information retrieval to address PEH bugs. We constructed a dataset containing 30 PEH bugs and evaluated EH-Fixer against two state-of-the-art approaches. Preliminary results indicate that EH-Fixer successfully fixed 19 more PEH bugs than existing approaches.