Wenpin Jiao

Wenpin Jiao

Auto-generated profile, based on publicly available information

Wenpin Jiao

Peking University, Beijing, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
27 September 2024 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
XJXue Jiang
Xue Jiang
YDYihong Dong
Yihong Dong
LWLecheng Wang
Lecheng Wang
ZFZheng Fang
Zheng Fang
QSQiwei Shang
Qiwei Shang
WJWenpin Jiao
Wenpin Jiao
Although large language models (LLMs) have demonstrated impressive ability in code generation, they are still struggling to address the complicated intent provided by humans. It is widely acknowledged that humans typically employ planning to decompose complex problems and schedule solution steps prior to implementation. To this end, we introduce planning into code generation to help the model understand complex intent and reduce the difficulty of problem-solving. This paper proposes a self-planning code generation approach with large language models, which consists of two phases, namely planning phase and implementation phase. Specifically, in the planning phase, LLM plans out concise solution steps from the intent combined with few-shot prompting. Subsequently, in the implementation phase, the model generates code step by step, guided by the preceding solution steps. We conduct extensive experiments on various code-generation benchmarks across multiple programming languages. Experimental results show that self-planning code generation achieves a relative improvement of up to 25.4% in Pass@1 compared to direct code generation, and up to 11.9% compared to Chain-of-Thought of code generation. Moreover, our self-planning approach also enhances the quality of the generated code with respect to correctness, readability, and robustness, as assessed by humans.

12 July 2023
Verified
Conference Paper
Open access
ZHZiyue Hua
Ziyue Hua
WLWei Lin
Wei Lin
LRLuyao Ren
Luyao Ren
ZLZongyang Li
Zongyang Li
LZLu Zhang
Lu Zhang
TXTao Xie
Tao Xie
Graph database engines stand out in the era of big data for their efficiency of modeling and processing linked data. To assure high quality of graph database engines, it is highly critical to conduct automatic test generation for graph database engines, e.g., random test generation, the most commonly adopted approach in practice. However, random test generation faces the challenge of generating complex inputs (i.e., property graphs and queries) for producing non-empty query results; generating such type of inputs is important especially for detecting wrong-result bugs. To address this challenge, in this paper, we propose GDsmith, the first approach for testing Cypher graph database engines. GDsmith ensures that each randomly generated query satisfies the semantic requirements. To increase the probability of producing complex queries that return non-empty results, GDsmith includes two new techniques: graph-guided generation of complex pattern combinations and data-guided generation of complex conditions. Our evaluation results demonstrate that GDsmith is effective and efficient for producing complex queries that return non-empty results for bug detection, and substantially outperforms the baselines. GDsmith successfully detects 28 bugs on the released versions of three highly popular open-source graph database engines and receives positive feedback from their developers.

3 August 2025
Verified
Conference Paper
Open access
YHYuanpeng He
Yuanpeng He
LLLijian Li
Lijian Li
TZTianxiang Zhan
Tianxiang Zhan
Chi-Man PunChi-Man Pun
Chi-Man Pun
WJWenpin Jiao
Wenpin Jiao
ZJZhi Jin
Zhi Jin

10 April 2025 in Pattern Recognition
Verified
Journal Article
Closed access
YHYuanpeng He
Yuanpeng He
LLLijian Li
Lijian Li
TZTianxiang Zhan
Tianxiang Zhan
Chi-Man PunChi-Man Pun
Chi-Man Pun
WJWenpin Jiao
Wenpin Jiao
ZJZhi Jin
Zhi Jin

11 July 2026 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
XJXue Jiang
Xue Jiang
YDYihong Dong
Yihong Dong
ZFZhiyuan Fan
Zhiyuan Fan
ZJZhi Jin
Zhi Jin
WJWenpin Jiao
Wenpin Jiao
GLGe Li
Ge Li
Although Large Language Models (LLMs) have made significant progress in code generation, they still struggle with code generation tasks in specific scenarios. These scenarios usually necessitate the adaptation of LLMs to fulfill specific needs, but the limited training data available in practice leads to poor code generation performance. Therefore, how to effectively adapt LLMs to new scenarios with few training data is a major challenge for current code generation. In this article, we propose a novel adaptation approach named Data-Efficient adaptation with Error-Driven Learning (DEED) for code generation. D EED leverages the errors made by LLMs as learning opportunities, using error revision to overcome their own shortcomings, thus achieving efficient learning. Specifically, D EED involves identifying error code generated by LLMs, employing S elf-Revise for code revision, optimizing the model with revised code, and iteratively adapting the process for continuous improvement. Experimental results show that, compared to other mainstream fine-tuning approaches, D EED achieves superior performance with few training data, showing an average relative improvement of 46.2% in Pass@1 on multiple code generation benchmarks. We also validate the effectiveness of S elf-Revise, which generates revised code that optimizes the model more efficiently compared to the code samples from datasets. Moreover, D EED consistently demonstrates strong performance across various LLMs, underscoring its applicability.

10 September 2010 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
YLYan Li
Yan Li
FCFeng-Hong Chen
Feng-Hong Chen
XSXi Sun
Xi Sun
MZMing-Hui Zhou
Ming-Hui Zhou
WJWen-Pin Jiao
Wen-Pin Jiao
HMHong Mei
Hong Mei