Yonghao Wu

Yonghao Wu

Auto-generated profile, based on publicly available information

Yonghao Wu

College of Information Science and Technology, Beijing University of Chemical Technology, Beijing, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
10 July 2024
Verified
Conference Paper
Open access
YWYonghao Wu
Yonghao Wu
ZLZheng Li
Zheng Li
JZJie M. Zhang
Jie M. Zhang
YLYong Liu
Yong Liu
With the growing interest on Large Language Models (LLMs) for fault localization and program repair, ensuring the integrity and generalizability of the LLM-based methods becomes paramount. The code in existing widely-adopted benchmarks for these tasks was written before the bloom of LLMs and may be included in the training data of existing popular LLMs, thereby suffering from the threat of data leakage, leading to misleadingly optimistic performance metrics. To address this issue, we introduce ConDefects, a dataset developed as a complement to existing datasets, meticulously curated with real faults to eliminate such overlap. ConDefects contains 1,254 Java faulty programs and 1,625 Python faulty programs. All these programs are sourced from the online competition platform AtCoder and were produced between October 2021 and September 2023. We pair each fault with fault locations and the corresponding repaired code versions, making it tailored for fault localization and program repair related research. We also provide interfaces for selecting subsets based on different time windows and coding task difficulties. While inspired by LLM-based tasks, ConDefects can be adopted for benchmarking ALL types of fault localization and program repair methods. The dataset is publicly available, and a demo video can be found at https://www.youtube.com/watch?v=22j15Hj5ONk.

29 March 2022 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
ZLZheng Li
Zheng Li
YWYonghao Wu
Yonghao Wu
BPBin Peng
Bin Peng
Xiang ChenXiang Chen
Xiang Chen
ZSZeyu Sun
Zeyu Sun
DPDoyle Paul
Doyle Paul
Automated code comment generation technologies can help developers understand code intent, which can significantly reduce the cost of software maintenance and revision. The latest studies in this field mainly depend on deep neural networks, such as convolutional neural networks and recurrent neural network. However, these methods may not generate high-quality and readable code comments due to the long-term dependence problem, which means that the code blocks used to summarize information are far from each other. Owing to the long-term dependence problem, these methods forget the previous input data’s feature information during the training process. In this article, to solve the long-term dependence problem and extract both the text and structure information from the program code, we propose a novel improved-Transformer-based comment generation method, named SeTransformer. Specifically, the SeTransformer utilizes the code tokens and an abstract syntax tree (AST) of programs to extract information as the inputs, and then, it leverages the self-attention mechanism to analyze the text and structural features of code simultaneously. Experimental results based on public corpus gathered from large-scale open-source projects show that our method can significantly outperform five state-of-the-art baselines (such as Hybrid-DeepCom and AST-attendgru). Furthermore, we also conduct a questionnaire survey for developers, and the results show that the SeTransformer can generate higher quality comments than those of other baselines.

30 September 2020 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
YWYong-Hao Wu
Yong-Hao Wu
ZLZheng Li
Zheng Li
YLYong Liu
Yong Liu
Xiang ChenXiang Chen
Xiang Chen

28 April 2022 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
YWYonghao Wu
Yonghao Wu
YLYong Liu
Yong Liu
WWWeibo Wang
Weibo Wang
ZLZheng Li
Zheng Li
Xiang ChenXiang Chen
Xiang Chen
PDPaul Doyle
Paul Doyle
To improve the efficiency of the fault localization process, different automatic fault localization approaches have been proposed. Among these approaches, the spectrum-based fault localization (SBFL) approach has been widely used and studied due to its lightweight and high effectiveness. However, while the existence of coincidental correct (CC) test cases can influence the usefulness of SBFL in single-fault programs, their influence on multiple fault programs has not been thoroughly investigated. Therefore, in this article, we conduct a theoretical analysis and an empirical study to investigate the effect of CC test cases on multiple fault localization. The theoretical analysis is based on a suspiciousness calculation formula of SBFL, which divides CC test cases into three categories (specific, irrelevant, and unspecific) according to their association with a specific faulty statement. Following this analysis, we conduct an empirical study on two well-known open-source repositories (SIR and Defects4J), and the experimental results verify the correctness of our theoretical analysis. Specifically, reducing the number of specific CC test cases for a faulty statement can improve or maintain fault localization accuracy, while eliminating irrelevant CC test cases can have a negative effect. Finally, we design a CC test case identification solution based on the isolation-based multiple fault localization approach and demonstrate its effectiveness via a simulation experiment.

6 December 2025 in Journal of Systems and Software
Verified
Journal Article
Closed access
HXHexiang Xu
Hexiang Xu
HLHengyuan Liu
Hengyuan Liu
YWYonghao Wu
Yonghao Wu
XKXiaolan Kang
Xiaolan Kang
Xiang ChenXiang Chen
Xiang Chen
YLYong Liu
Yong Liu

7 November 2025 in Pattern Recognition
Verified
Journal Article
Closed access
LXLiu Xue-Jun
Liu Xue-Jun
ZTZhaichao Tang
Zhaichao Tang
YWYonghao Wu
Yonghao Wu
RZRuixiang Zhai
Ruixiang Zhai
XDXuanhe Dong
Xuanhe Dong
SCShujun Cao
Shujun Cao