Xiufeng Xu

Xiufeng Xu

Auto-generated profile, based on publicly available information

Xiufeng Xu

Nanyang technological university, Singapore, Singapore

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
20 April 2024
Verified
Conference Paper
Open access
ZLZhiming Li
Zhiming Li
YCYushi Cao
Yushi Cao
XXXiufeng Xu
Xiufeng Xu
JJJunzhe Jiang
Junzhe Jiang
XLXu Liu
Xu Liu
YLYang Liu
Yang Liu
Large language models (LLMs) have revolutionized many areas (e.g. natural language processing, software engineering, etc.) by achieving state-of-the-art performance on extensive downstream tasks. Aiming to achieve robust and general artificial intelligence, there has been a surge of interest in investigating the reasoning ability of the LLMs. Whereas the textual and numerical reasoning benchmarks adopted by previous works are rather shallow and simple, it is hard to conclude that the LLMs possess strong reasoning ability by merely achieving positive results on these benchmarks. Recent efforts have demonstrated that the LLMs are poor at solving sequential decision-making problems that require common-sense planning by evaluating their performance on the reinforcement learning benchmarks. In this work, we conduct an in-depth assessment of several state-of-the-art LLMs' reasoning ability based on the inductive logic programming (ILP) benchmark, which is broadly recognized as a representative and challenging measurement for evaluating logic program induction/synthesis systems as it requires inducing strict cause-effect logic to achieve robust deduction on independent and identically distributed (IID) and out-of-distribution (OOD) test samples. Our evaluations illustrate that compared with the neural program induction systems which are much smaller in model size, the state-of-the-art LLMs are much poorer in terms of reasoning ability by achieving much lower performance and generalization using either natural language prompting or truth-value matrix prompting1.

26 May 2023 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
CZChenguang Zhu
Chenguang Zhu
MZMengshi Zhang
Mengshi Zhang
XWXiuheng Wu
Xiuheng Wu
XXXiufeng Xu
Xiufeng Xu
YLYi Li
Yi Li
Modern software systems are complex, and they heavily rely on external libraries developed by different teams and organizations. Such systems suffer from higher instability due to incompatibility issues caused by library upgrades. In this article, we address the problem by investigating the impact of a library upgrade on the behaviors of its clients. We developed CompCheck , an automated upgrade compatibility checking framework that generates incompatibility-revealing tests based on previous examples. CompCheck first establishes an offline knowledge base of incompatibility issues by mining from open source projects and their upgrades. It then discovers incompatibilities for a specific client project, by searching for similar library usages in the knowledge base and generating tests to reveal the problems. We evaluated CompCheck on 202 call sites of 37 open source projects and the results show that CompCheck successfully revealed incompatibility issues on 76 call sites, 72.7% and 94.9% more than two existing techniques, confirming CompCheck ’s applicability and effectiveness.

23 June 2025
Verified
Conference Paper
Open access
CLChengwei Liu
Chengwei Liu
LZLyuye Zhang
Lyuye Zhang
XXXiufeng Xu
Xiufeng Xu
WGWenbo Guo
Wenbo Guo
YLYang Liu
Yang Liu

22 June 2025 in Proceedings of the ACM on Software Engineering
Verified
Journal Article
Open access
XXXiufeng Xu
Xiufeng Xu
FXFuman Xie
Fuman Xie
CZChenguang Zhu
Chenguang Zhu
GBGuangdong Bai
Guangdong Bai
SKSarfraz Khurshid
Sarfraz Khurshid
YLYi Li
Yi Li
Modern AI- and Data-intensive software systems rely heavily on data science and machine learning libraries that provide essential algorithmic implementations and computational frameworks. These libraries expose complex APIs whose correct usage has to follow constraints among multiple interdependent parameters. Developers using these APIs are expected to learn about the constraints through the provided documentation and any discrepancy may lead to unexpected behaviors. However, maintaining correct and consistent multi-parameter constraints in API documentation remains a significant challenge for API compatibility and reliability. To address this challenge, we propose MPChecker for detecting inconsistencies between code and documentation, specifically focusing on multi-parameter constraints. MPChecker identifies these constraints at the code level by exploring execution paths through symbolic execution and further extracts corresponding constraints from documentation using large language models (LLMs). We propose a customized fuzzy constraint logic to reconcile the unpredictability of LLM outputs and detect logical inconsistencies between the code and documentation constraints. We collected and constructed two datasets from four popular data science libraries and evaluated MPChecker on them. Our tool identified 117 of 126 inconsistent constraints, achieving a recall of 92.8% and demonstrating its effectiveness at detecting inconsistency issues. We further reported 14 detected inconsistency issues to the library developers, who have confirmed 11 issues at the time of writing.