Xiao Yu

Dr. Xiao Yu


Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

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

Representative Publications

View All Publications
26 September 2021 in Sensors
Verified
Journal Article
Open access
PDF file
YCyizhou chen
yizhou chen
HDHeng Dai
Heng Dai
XYXiao Yu
Xiao Yu
WHWenhua Hu
Wenhua Hu
ZXZhiwen Xie
Zhiwen Xie
CTCheng Tan
Cheng Tan
With the development of blockchain technologies, many Ponzi schemes disguise themselves under the veil of smart contracts. The Ponzi scheme contracts cause serious financial losses, which has a bad effect on the blockchain. Existing Ponzi scheme contract detection studies have mainly focused on extracting hand-crafted features and training a machine learning classifier to detect Ponzi scheme contracts. However, the hand-crafted features cannot capture the structural and semantic feature of the source code. Therefore, in this study, we propose a Ponzi scheme contract detection method called MTCformer (Multi-channel Text Convolutional Neural Networks and Transofrmer). In order to reserve the structural information of the source code, the MTCformer first converts the Abstract Syntax Tree (AST) of the smart contract code to the specially formatted code token sequence via the Structure-Based Traversal (SBT) method. Then, the MTCformer uses multi-channel TextCNN (Text Convolutional Neural Networks) to learn local structural and semantic features from the code token sequence. Next, the MTCformer employs the Transformer to capture the long-range dependencies of code tokens. Finally, a fully connected neural network with a cost-sensitive loss function in the MTCformer is used for classification. The experimental results show that the MTCformer is superior to the state-of-the-art methods and its variants in Ponzi scheme contract detection.

5 November 2024 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
XYXiao Yu
Xiao Yu
LLLei Liu
Lei Liu
XHXing Hu
Xing Hu
JKJacky Wai Keung
Jacky Wai Keung
JLJin Liu
Jin Liu
XXXin Xia
Xin Xia
With the increasing utilization of large language models such as ChatGPT during software development, it has become crucial to verify the quality of code content it generates. Recent studies proposed utilizing ChatGPT as both a developer and tester for multi-agent collaborative software development. The multi-agent collaboration empowers ChatGPT to produce test reports for its generated code, enabling it to self-verify the code content and fix bugs based on these reports. However, these studies did not assess the effectiveness of the generated test reports in validating the code. Therefore, we conduct a comprehensive empirical investigation to evaluate ChatGPT’s self-verification capability in code generation, code completion, and program repair. We request ChatGPT to (1) generate correct code and then self-verify its correctness; (2) complete code without vulnerabilities and then self-verify for the presence of vulnerabilities; and (3) repair buggy code and then selfverify whether the bugs are resolved. Our findings on two code generation datasets, one code completion dataset, and two program repair datasets reveal the following observations: (1) ChatGPT often erroneously predicts its generated incorrect code as correct, its vulnerable completed code as non-vulnerable, and its failed program repairs as successful during its self-verification. (2) The self-contradictory hallucinations in ChatGPT’s behavior arise: (a) ChatGPT initially generates code that it believes to be correct but later predicts it to be incorrect; (b) ChatGPT initially generates code completions that it deems secure but later predicts them to be vulnerable; (c) ChatGPT initially outputs code that it considers successfully repaired but later predicts it to be buggy during its self-verification. (3) The self-verification capability of ChatGPT can be enhanced by asking the guiding question, which queries whether ChatGPT agrees with assertions about incorrectly generated or repaired code and vulnerabilities in completed code. (4) Using test reports generated by ChatGPT can identify more vulnerabilities in completed code, but the explanations for incorrectly generated code and failed repairs are mostly inaccurate in the test reports. Based on these findings, we provide implications for further research or development using ChatGPT.

5 February 2023 in IET Software
Verified
Journal Article
Open access
FLFuyang Li
Fuyang Li
WLWanpeng Lu
Wanpeng Lu
JKJacky Wai Keung
Jacky Wai Keung
XYXiao Yu
Xiao Yu
LGLina Gong
Lina Gong
JLJuan Li
Juan Li
Effort‐Aware Defect Prediction (EADP) methods sort software modules based on the defect density and guide the testing team to inspect the modules with high defect density first. Previous studies indicated that some feature selection methods could improve the performance of Classification‐Based Defect Prediction (CBDP) models, and the Correlation‐based feature subset selection method with the Best First strategy (CorBF) performed the best. However, the practical benefits of feature selection methods on EADP performance are still unknown, and blindly employing the best‐performing CorBF method in CBDP to pre‐process the defect datasets may not improve the performance of EADP models but possibly result in performance degradation. To assess the impact of the feature selection techniques on EADP, a total of 24 feature selection methods with 10 classifiers embedded in a state‐of‐the‐art EADP model (CBS+) on the 41 PROMISE defect datasets were examined. We employ six evaluation metrics to assess the performance of EADP models comprehensively. The results show that (1) The impact of the feature selection methods varies in classifiers and datasets. (2) The four wrapper‐based feature subset selection methods with forwards search, that is, AdaBoost with Forwards Search, Deep Forest with Forwards Search, Random Forest with Forwards Search, and XGBoost with Forwards Search (XGBF) are better than other methods across the studied classifiers and the used datasets. And XGBF with XGBoost as the embedded classifier in CBS+ performs the best on the datasets. (3) The best‐performing CorBF method in CBDP does not perform well on the EADP task. (4) The selected features vary with different feature selection methods and different datasets, and the features noc (number of children), ic (inheritance coupling), cbo (coupling between object classes), and cbm (coupling between methods) are frequently selected by the four wrapper‐based feature subset selection methods with forwards search. (5) Using AdaBoost, deep forest, random forest, and XGBoost as the base classifiers embedded in CBS+ can achieve the best performance. In summary, we recommend the software testing team should employ XGBF with XGBoost as the embedded classifier in CBS+ to enhance the EADP performance.

22 January 2022 in Information and Software Technology
Verified
Journal Article
Closed access
XYXiao Yu
Xiao Yu
JKJacky Keung
Jacky Keung
YXYan Xiao
Yan Xiao
SFShuo Feng
Shuo Feng
FLFuyang Li
Fuyang Li
HDHeng Dai
Heng Dai

29 March 2023 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
ZYZhen Yang
Zhen Yang
JKJacky Wai Keung
Jacky Wai Keung
XYXiao Yu
Xiao Yu
YXYan Xiao
Yan Xiao
ZJZhi Jin
Zhi Jin
JZJingyu Zhang
Jingyu Zhang
Software comments sometimes are not promptly updated in sync when the associated code is changed. The inconsistency between code and comments may mislead the developers and result in future bugs. Thus, studies concerning code-comment synchronization have become highly important, which aims to automatically synchronize comments with code changes. Existing code-comment synchronization approaches mainly contain two types, i.e., (1) deep learning-based (e.g., CUP), and (2) heuristic-based (e.g., HebCUP). The former constructs a neural machine translation-structured semantic model, which has a more generalized capability on synchronizing comments with software evolution and growth. However, the latter designs a series of rules for performing token-level replacements on old comments, which can generate the completely correct comments for the samples fully covered by their fine-designed heuristic rules. In this article, we propose a composite approach named CBS (i.e., Classifying Before Synchronizing ) to further improve the code-comment synchronization performance, which combines the advantages of CUP and HebCUP with the assistance of inferred categories of Code-Comment Inconsistent (CCI) samples. Specifically, we firstly define two categories (i.e., heuristic-prone and non-heuristic-prone) for CCI samples and propose five features to assist category prediction. The samples whose comments can be correctly synchronized by HebCUP are heuristic-prone, while others are non-heuristic-prone. Then, CBS employs our proposed Multi-Subsets Ensemble Learning (MSEL) classification algorithm to alleviate the class imbalance problem and construct the category prediction model. Next, CBS uses the trained MSEL to predict the category of the new sample. If the predicted category is heuristic-prone, CBS employs HebCUP to conduct the code-comment synchronization for the sample, otherwise, CBS allocates CUP to handle it. Our extensive experiments demonstrate that CBS statistically significantly outperforms CUP and HebCUP, and obtains an average improvement of 23.47%, 22.84%, 3.04%, 3.04%, 1.64%, and 19.39% in terms of Accuracy, Recall@5, Average Edit Distance (AED) , Relative Edit Distance (RED) , BLEU-4, and Effective Synchronized Sample (ESS) ratio, respectively, which highlights that category prediction for CCI samples can boost the code-comment synchronization performance.

22 March 2023 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
KJKai Jia
Kai Jia
XYXiao Yu
Xiao Yu
CZChen Zhang
Chen Zhang
WHWenhua Hu
Wenhua Hu
DZDongdong Zhao
Dongdong Zhao
JXJianwen Xiang
Jianwen Xiang
Software aging, which is caused by the accumulation of errors in the system and the consumption of computing resources, tends to occur in long-running cloud service software systems. In practice, software aging prediction has proven to be useful in planning the time to trigger rejuvenation because it provides a prior estimate of future resource consumption. However, aging indicators (e.g., physical memory) in cloud may have the characteristics of long-term slow growth, medium-term seasonality variations (alternating peaks and troughs), and short-term irregular fluctuations. Unfortunately, most of the existing aging prediction methods (e.g., a statistical or single machine learning model) only focus on the accuracy of short-term prediction, while lacking the cognition of the medium and long-term variations of aging indicators and their functions in formulating the rejuvenation schedule (e.g., performing rejuvenation when the load is low can minimize interference to users). To address the above problems, this paper proposes a novel hybrid aging prediction framework to work on the prediction of memory resource consumption in cloud by applying a seasonal-trend decomposition procedure based on loess (STL) method and Gate Recurrent Unit (GRU) neural network, called the decomposition-based GRU (DGRU). The effectiveness of DGRU mainly has two aspects. One is the STL method as a preprocessing technology that can extract the trend, seasonality, and residual characteristics from memory utilization data. The other is that these characteristics can be well predicted separately by a well-designed GRU model, which can model the time-series relationship between the data. Experimental results show that our DGRU framework has superior performance compared with its competitors, including seven single models and six hybrid models. Our study illustrates that the DGRU is a promising solution for high-precision software aging prediction.