Dingbang Fang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Dingbang Fang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ai Liu
College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics
3 shared publications - Shaoying Liu
East China Normal University
3 shared publications Guangquan Xu
School of Cybersecurity, College of Intelligence and Computing, Tianjin University Tianjin 300072, China
1 shared publication- Guangquan Xu
Tianjin University
1 shared publication Haiyi Liu
Hiroshima University
1 shared publication- Haiyi Liu
Jiangsu Second Normal University
1 shared publication
Latest Publications
- 17 October 2023
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 34 (02) , 273-300
NNTBFV: Simplifying and Verifying Neural Networks Using Testing-Based Formal Verification
Neural networks are extensively employed in safety-critical systems. However, these critical systems incorporating neural networks continue to pose risks due to the presence of adversarial examples. Although the security of neural networks can be enhanced by verification, verifying neural networks is an NP-hard problem, making the application of verification algorithms to large-scale neural networks a challenging task. For this reason, we propose NNTBFV, a framework that utilizes the principles of Testing-Based Formal Verification (TBFV) to simplify neural networks and verify the simplified networks. Unlike conventional neural network pruning techniques, this approach is based on specifications, with the goal of deriving approximate execution paths under given preconditions. To mitigate the potential issue of unverifiable conditions due to overly broad preconditions, we also propose a precondition partition method. Empirical evidence shows that as the range of preconditions narrows, the size of the execution paths also reduces accordingly. The execution path generated by NNTBFV is still a neural network, so it can be verified by verification tools. In response to the results from the verification tool, we provide a theoretical method for analysis. We evaluate the effectiveness of NNTBFV on the ACAS Xu model project, choosing Verification-based and Random-based neural network simplification algorithms as the baselines for NNTBFV. Experiment results show that NNTBFV can effectively approximate the baseline in terms of simplification capability, and it surpasses the efficiency of the random-based method.
- 17 October 2023
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 34 (02) , 273-300
NNTBFV: Simplifying and Verifying Neural Networks Using Testing-Based Formal Verification
Neural networks are extensively employed in safety-critical systems. However, these critical systems incorporating neural networks continue to pose risks due to the presence of adversarial examples. Although the security of neural networks can be enhanced by verification, verifying neural networks is an NP-hard problem, making the application of verification algorithms to large-scale neural networks a challenging task. For this reason, we propose NNTBFV, a framework that utilizes the principles of Testing-Based Formal Verification (TBFV) to simplify neural networks and verify the simplified networks. Unlike conventional neural network pruning techniques, this approach is based on specifications, with the goal of deriving approximate execution paths under given preconditions. To mitigate the potential issue of unverifiable conditions due to overly broad preconditions, we also propose a precondition partition method. Empirical evidence shows that as the range of preconditions narrows, the size of the execution paths also reduces accordingly. The execution path generated by NNTBFV is still a neural network, so it can be verified by verification tools. In response to the results from the verification tool, we provide a theoretical method for analysis. We evaluate the effectiveness of NNTBFV on the ACAS Xu model project, choosing Verification-based and Random-based neural network simplification algorithms as the baselines for NNTBFV. Experiment results show that NNTBFV can effectively approximate the baseline in terms of simplification capability, and it surpasses the efficiency of the random-based method.
- 6 July 2023
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 33 (07) , 1095-1117
Cross-Project Transfer Learning on Lightweight Code Semantic Graphs for Defect Prediction
A deep learning system (DLS) developed based on one software project for defect prediction may well be applied to the related code on the same project but is usually difficult to be applied to new or unknown software projects. To address this problem, we propose a Transferable Graph Convolutional Neural Network (TGCNN) that can learn defects from the lightweight semantic graphs of code and transfer the learned knowledge from the source project to the target project. We discuss how the semantic graph is constructed from code; how the TGCNN can learn from the graph; and how the learned knowledge can be transferred to a new or unknown project. We also conduct a controlled experiment to evaluate our method. The result shows that despite some limitations, our method performs considerably better than existing methods.
- 6 July 2023
- Published by World Scientific Pub Co Pte Ltd in International Journal of Software Engineering and Knowledge Engineering
- Vol. 33 (07) , 1095-1117
Cross-Project Transfer Learning on Lightweight Code Semantic Graphs for Defect Prediction
A deep learning system (DLS) developed based on one software project for defect prediction may well be applied to the related code on the same project but is usually difficult to be applied to new or unknown software projects. To address this problem, we propose a Transferable Graph Convolutional Neural Network (TGCNN) that can learn defects from the lightweight semantic graphs of code and transfer the learned knowledge from the source project to the target project. We discuss how the semantic graph is constructed from code; how the TGCNN can learn from the graph; and how the learned knowledge can be transferred to a new or unknown project. We also conduct a controlled experiment to evaluate our method. The result shows that despite some limitations, our method performs considerably better than existing methods.
- 25 March 2023
- Published by Springer Nature
- p. 126-141
Verifying and Improving Neural Networks Using Testing-Based Formal Verification
- 25 March 2023
- Published by Springer Nature
- p. 126-141
Verifying and Improving Neural Networks Using Testing-Based Formal Verification
- 28 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 71 (2) , 512-526
Gated Homogeneous Fusion Networks With Jointed Feature Extraction for Defect Prediction
Software defect prediction is aimed at helping developers to quickly locate defective components in the code repository and thus better allocate resources. However, most of the current traditional defect prediction methods mainly depend on the design of static metrics, but these methods ignore the semantic and structural information of the code. As a result, researchers have turned to building models by extracting semantic features from code through abstract syntax trees. In this article, we introduce gated homogeneous fusion network for defect prediction namely GHFNet, jointing high-level semantic feature extraction and weighted static feature extraction. Through the mechanism of homogeneous gating fusion, weights are adaptively assigned to the two types of features based on the correlation of these features to form fused features for defect prediction in the code. Experimental results show that the proposed approach is a significant improvement. Specifically, for the reference method we present GHFNet improved from 9.4 to 15.2 percentage points in effort-unaware scenarios (F-measure) and from 3.7 to 8 percentage points in effort-aware scenarios (Popt) for defect prediction.
- 28 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 71 (2) , 512-526
Gated Homogeneous Fusion Networks With Jointed Feature Extraction for Defect Prediction
Software defect prediction is aimed at helping developers to quickly locate defective components in the code repository and thus better allocate resources. However, most of the current traditional defect prediction methods mainly depend on the design of static metrics, but these methods ignore the semantic and structural information of the code. As a result, researchers have turned to building models by extracting semantic features from code through abstract syntax trees. In this article, we introduce gated homogeneous fusion network for defect prediction namely GHFNet, jointing high-level semantic feature extraction and weighted static feature extraction. Through the mechanism of homogeneous gating fusion, weights are adaptively assigned to the two types of features based on the correlation of these features to form fused features for defect prediction in the code. Experimental results show that the proposed approach is a significant improvement. Specifically, for the reference method we present GHFNet improved from 9.4 to 15.2 percentage points in effort-unaware scenarios (F-measure) and from 3.7 to 8 percentage points in effort-aware scenarios (Popt) for defect prediction.