VLDB 2026 Research / reviewers in the wild / expert
Yiyang Hao
dblp:127/0513
· DBLP profile ↗
8ranked-venue papers
2as first author
4since 2021 · last 2024
0000-0002-0346-9555ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 8 · 2 first-author · 4 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Non-Autoregressive Line-Level Code CompletionabstractSoftware developers frequently use code completion tools to accelerate software development by suggesting the following code elements. Researchers usually employ AutoRegressive (AR) decoders to complete code sequences in a left-to-right, token-by-token fashion. To improve the accuracy and efficiency of code completion, we argue that tokens within a code statement have the potential to be predicted concurrently. In this article, we first conduct an empirical study to analyze the dependency among the target tokens in line-level code completion. The results suggest that it is potentially practical to generate all statement tokens in parallel. To this end, we introduce SANAR, a simple and effective syntax-aware non-autoregressive model for line-level code completion. To further improve the quality of the generated code, we propose an adaptive and syntax-aware sampling strategy to boost the model’s performance. The experimental results obtained from two widely used datasets indicate that our model outperforms state-of-the-art code completion approaches of similar model size by a considerable margin, and is faster than these models with up to 9× speed-up. Moreover, the extensive results additionally demonstrate that the enhancements achieved by SANAR become even more pronounced with larger model sizes, highlighting their significance. Fang Liu 0032, Zhiyi Fu, Ge Li 0001, Zhi Jin 0001, Hui Liu 0003, Yiyang Hao, Li Zhang 0029 |
ACM Trans. Softw. Eng. Methodol. | 6 |
| 2023 | SkCoder: A Sketch-based Approach for Automatic Code GenerationabstractRecently, deep learning techniques have shown great success in automatic code generation. Inspired by the code reuse, some researchers propose copy-based approaches that can copy the content from similar code snippets to obtain better performance. Practically, human developers recognize the content in the similar code that is relevant to their needs, which can be viewed as a code sketch. The sketch is further edited to the desired code. However, existing copy-based approaches ignore the code sketches and tend to repeat the similar code without necessary modifications, which leads to generating wrong results. In this paper, we propose a sketch-based code generation approach named Skcoderto mimic developers' code reuse behavior. Given a natural language requirement, Skcoderretrieves a similar code snippet, extracts relevant parts as a code sketch, and edits the sketch into the desired code. Our motivations are that the extracted sketch provides a well-formed pattern for telling models “how to write”. The post-editing further adds requirement-specific details into the sketch and outputs the complete code. We conduct experiments on two public datasets and a new dataset collected by this work. We compare our approach to 20 baselines using 5 widely used metrics. Experimental results show that (1) Skcodercan generate more correct programs, and outperforms the state-of-the-art -CodeT5-base by 30.30%, 35.39%, and 29.62% on three datasets. (2) Our approach is effective to multiple code generation models and improves them by up to 120.1% in Pass@l. (3) We investigate three plausible code sketches and discuss the importance of sketches. (4) We manually evaluate the generated code and prove the superiority of our Skcoderin three aspects. Jia Li 0011, Yongmin Li 0004, Ge Li 0001, Zhi Jin 0001, Yiyang Hao, Xing Hu 0008 |
ICSE | 5 |
| 2023 | AdaComplete: improve DL-based code completion method's domain adaptability
Fang Liu 0032, Yiyang Hao, Zhi Jin 0001 |
Autom. Softw. Eng. | 3 |
| 2022 | Learning to Recommend Method Names with Global ContextabstractIn programming, the names for the program entities, especially for the methods, are the intuitive characteristic for understanding the functionality of the code. To ensure the readability and maintainability of the programs, method names should be named properly. Specifically, the names should be meaningful and consistent with other names used in related contexts in their codebase. In recent years, many automated approaches are proposed to suggest consistent names for methods, among which neural machine translation (NMT) based models are widely used and have achieved state-of-the-art results. However, these NMT-based models mainly focus on extracting the code-specific features from the method body or the surrounding methods, the project-specific context and documentation of the target method are ignored. We conduct a statistical analysis to explore the relationship between the method names and their contexts. Based on the statistical results, we propose GTNM, a Global Transformer-based Neural Model for method name suggestion, which considers the local context, the project-specific context, and the documentation of the method simultaneously. Experimental results on java methods show that our model can outperform the state-of-the-art results by a large margin on method name suggestion, demonstrating the effectiveness of our proposed model. Fang Liu 0032, Ge Li 0001, Zhiyi Fu, Yiyang Hao, Zhi Jin 0001 |
ICSE | 5 |
| 2015 | A Third-Party Extension Support Framework Using PatternsabstractSoftware extension is a fundamental challenge in software engineering which involves extending the functionalities of a software module without modifying it. Many modern software developers choose to adapt third-party extension platform to further improve customizability. As the project evolves, the requirements may change to include third-party extension support. However to design and to implement such platform is no trivial task, and should happen at the beginning of the project. In this paper, we have shown the four types of extensions that are often made to object-oriented software, namely Member Access Extension, Subclass Extension, Event-based Extension and Data Extension. And proposed a language-independent platform design that can be applied to an existing software project to support such third-party extensions. The platform exercises design patterns to implement its features. We also developed an Eclipse plugin that helps developers introduce the platform to existing Java software via semi-automatic code manipulation. We further conducted a comparative experiment to test our tool with volunteers from Waseda University and noticed a significant decrease of required effort. Yiyang Hao, Hironori Washizaki, Yoshiaki Fukazawa |
APSEC | 1 |
| 2013 | MCT: a tool for commenting programs by multimedia commentsabstractProgram comments have always been the key to understanding code. However, typical text comments can easily become verbose or evasive. Thus sometimes code reviewers find an audio or video code narration quite helpful. In this paper, we present our tool, called MCT (Multimedia Commenting Tool), which is an integrated development environment-based tool that enables programmers to easily explain their code by voice, video and mouse movement in the form of comments. With this tool, programmers can replay the audio or video when they feel like. A demonstration video can be accessed at: http://www.youtube.com/watch?v=tHEHqZme4VE. Yiyang Hao, Ge Li 0001, Lili Mou, Lu Zhang 0023, Zhi Jin 0001 |
ICSE | 1 |
| 2013 | A Knowware Based Infrastructure for Rule Based Control Systems in Smart Spaces
Yangyang Lu, Ge Li 0001, Zhi Jin 0001, Xueyuan Xing, Yiyang Hao |
ICSR | 5 |
| 2012 | Discovering Domain Concepts and Hyponymy Relations by Text Relevance Classifying Based Iterative Web SearchingabstractDomain concepts and taxonomic relationships are an essential part of a domain ontology. They are used in a number of applications, including natural language processing, information retrieval, knowledge management and so on. Nowadays, with the continuous permeation of various kinds of Internet knowledge applications, numerous new concepts are emerged and released on to the Internet. So, the Internet has become an invaluable source of new concepts for almost every possible domain of knowledge. In order to ensure the domain ontologies keep pace with fast changing knowledge, we proposed an web searching based concepts and taxonomic relationships discovering approach. By our approach, the potential concepts on the Internet, which are taxonomically related with the give seeds concepts, can be discovered autonomously and iteratively. In this paper, the approach and a corresponding application in Chinese web pages are reported in detail. The experiments show that, our approach can catch the related domain concepts precisely, meanwhile, can reject irrelevant concepts and figure out the domain knowledge border definitely. Lili Mou, Ge Li 0001, Zhi Jin 0001, Yangyang Lu, Yiyang Hao |
APSEC | 5 |