Zheng Zheng

Zheng Zheng

Auto-generated profile, based on publicly available information

Zheng Zheng

Beihang University, Beijing, China

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
19 July 2022 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
XCXiao Cheng
Xiao Cheng
XNXu Nie
Xu Nie
NLNingke Li
Ningke Li
HWHaoyu Wang
Haoyu Wang
ZZZheng Zheng
Zheng Zheng
YSYulei Sui
Yulei Sui
Machine learning and its promising branch deep learning have proven to be effective in a wide range of application domains. Recently, several efforts have shown success in applying deep learning techniques for automatic vulnerability discovery, as alternatives to traditional static bug detection. In principle, these learning-based approaches are built on top of classification models using supervised learning. Depending on the different granularities to detect vulnerabilities, these approaches rely on learning models which are typically trained with well-labeled source code to predict whether a program method, a program slice, or a particular code line contains a vulnerability or not. The effectiveness of these models is normally evaluated against conventional metrics including precision, recall and F1 score. In this paper, we show that despite yielding promising numbers, the above evaluation strategy can be insufficient and even misleading when evaluating the effectiveness of current learning-based approaches. This is because the underlying learning models only produce the classification results or report individual/isolated program statements, but are unable to pinpoint bug-triggering paths, which is an effective way for bug fixing and the main aim of static bug detection. Our key insight is that a program method or statement can only be stated as vulnerable in the context of a bug-triggering path. In this work, we systematically study the gap between recent learning-based approaches and conventional static bug detectors in terms of fine-grained metrics called BTP metrics using bug-triggering paths. We then characterize and compare the quality of the prediction results of existing learning-based detectors under different granularities. Finally, our comprehensive empirical study reveals several key issues and challenges in developing classification models to pinpoint bug-triggering paths and calls for more advanced learning-based bug detection techniques.

29 August 2018 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
FQFangyun Qin
Fangyun Qin
ZZZheng Zheng
Zheng Zheng
YQYu Qiao
Yu Qiao
KTKishor S. Trivedi
Kishor S. Trivedi
In long running systems, software tends to encounter performance degradation and increasing failure rate during execution. This phenomenon has been named software aging, which is caused by aging-related bugs (ARBs). Testing resource allocation can be optimized by identifying ARB-prone modules with ARB prediction. However, due to the low presence and reproducing difficulty of ARBs, it is usually hard to collect sufficient training data to carry out within-project ARB prediction. In this paper, we propose an approach named transfer learning based aging-related bug prediction (TLAP) to perform cross-project ARB prediction. TLAP first takes advantage of transfer learning to reduce distribution difference between training and testing project. Then, class imbalance learning is conducted to mitigate the severe class imbalance between ARB-prone and ARB-free modules. Finally, machine learning methods are used to handle bug prediction tasks. The effectiveness of this approach is validated and evaluated by nine groups of experiments on real software systems. Major conclusions from the experiments include the following: first, TLAP improves cross-project ARB prediction on average compared with traditional machine learning methods; second, utilizing information from multiple-projects can further improve the prediction performance on average. In the best case, it outperforms within-project prediction; third, the number of ARB-prone files and distribution similarity can influence TLAP performance.

20 July 2020 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
KQKun Qiu
Kun Qiu
ZZZheng Zheng
Zheng Zheng
TCTsong Yueh Chen
Tsong Yueh Chen
PPPak-Lok Poon
Pak-Lok Poon
Metamorphic Relations (MRs) play a key role in determining the fault detection capability of Metamorphic Testing (MT). As human judgement is required for MR identification, systematic MR generation has long been an important research area in MT. Additionally, due to the extra program executions required for follow-up test cases, some concerns have been raised about MT cost-effectiveness. Consequently, the reduction in testing costs associated with MT has become another important issue to be addressed. MR composition can address both of these problems. This technique can automatically generate new MRs by composing existing ones, thereby reducing the number of follow-up test cases. Despite this advantage, previous studies on MR composition have empirically shown that some composite MRs have lower fault detection capability than their corresponding component MRs. To investigate this issue, we performed theoretical and empirical analyses to identify what characteristics component MRs should possess so that their corresponding composite MR has at least the same fault detection capability as the component MRs do. We have also derived a convenient, but effective guideline so that the fault detection capability of MT will most likely not be reduced after composition.

17 April 2024 in Biomedical Signal Processing and Control
Verified
Journal Article
Closed access
ZLZilin Liang
Zilin Liang
ZZZheng Zheng
Zheng Zheng
WCWeihai Chen
Weihai Chen
ZPZhongcai Pei
Zhongcai Pei
JWJianhua Wang
Jianhua Wang
JCJianer Chen
Jianer Chen

1 February 2018 in Journal of Systems and Software
Verified
Journal Article
Closed access
Xiaoyi ZhangXiaoyi Zhang
Xiaoyi Zhang
ZZZheng Zheng
Zheng Zheng
KCKai-Yuan Cai
Kai-Yuan Cai

5 June 2019 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
GXGuanping Xiao
Guanping Xiao
ZZZheng Zheng
Zheng Zheng
BYBeibei Yin
Beibei Yin
KTKishor S. Trivedi
Kishor S. Trivedi
XDXiaoting Du
Xiaoting Du
KCKai-Yuan Cai
Kai-Yuan Cai
This paper presents an empirical study of 5741 bug reports for the Linux kernel from an evolutionary perspective, with the aim of obtaining a deep understanding of bug characteristics in the Linux operating system. Bug classification is performed based on the fault triggering conditions, followed by an analysis of the proportions and evolution of the bug types as well as comparisons among versions, products, and repair locations. In addition, an analysis of regression bugs and the relationship between the types of bugs and the time needed to fix them are presented. Moreover, a procedure for the analysis of bug type characteristics based on complex network metrics is proposed, and four network metrics, i.e., degree, clustering coefficient, betweenness, and closeness, are utilized to further investigate the relationship between bug types and software metrics. In this paper, 22 interesting findings based on the empirical results are revealed, and guidance based on these findings is provided for developers and users.