Xuandong Li

Xuandong Li

Auto-generated profile, based on publicly available information

Xuandong Li

Nanjing University, Nanjing, China

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

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

Representative Publications

View All Publications
1 August 2007 in The Computer Journal
Verified
Journal Article
Closed access
PDF file
MCMingsong Chen
Mingsong Chen
XQXiaokang Qiu
Xiaokang Qiu
WXWei Xu
Wei Xu
LWLinzhang Wang
Linzhang Wang
JZJianhua Zhao
Jianhua Zhao
XLXuandong Li
Xuandong Li
Test case generation based on design specifications is an important part of testing processes. In this paper, Unified Modeling Language activity diagrams are used as design specifications. By setting up several test adequacy criteria with respect to activity diagrams, an automatic approach is presented to generate test cases for Java programs. Instead of directly deriving test cases from activity diagrams, this approach selects test cases from a set of randomly generated ones according to a given test adequacy criterion. In the approach, we first instrument a Java program under testing according to its activity diagram model, and randomly generate abundant test cases for the program. Then, by running the instrumented program we obtain the corresponding program execution traces. Finally, by matching these traces with the behavior of the activity diagram, a reduced set of test cases are selected according to the given test adequacy criterion. This approach can also be used to check the consistency between the program execution traces and the behavior of activity diagrams.

8 July 2020 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
MPMinxue Pan
Minxue Pan
TXTongtong Xu
Tongtong Xu
YPYu Pei
Yu Pei
ZLZhong Li
Zhong Li
TZTian Zhang
Tian Zhang
XLXuandong Li
Xuandong Li
Graphical User Interface (GUI) testing is widely used to test mobile apps. As mobile apps are frequently updated and need repeated testing, to reduce the test cost, their test cases are often coded as scripts to enable automated execution using test harnesses/tools. When those mobile apps evolve, many of the test scripts, however, may become broken due to changes made to the app GUIs. While it is desirable that the broken scripts get repaired, doing it manually can be preventively expensive if the number of tests need repairing is large. We propose in this paper a novel approach named METER to repairing broken GUI test scripts automatically when mobile apps evolve. METER leverages computer vision techniques to infer GUI changes between two versions of a mobile app and uses the inferred changes to guide the repair of GUI test scripts. Since METER only relies on screenshots to repair GUI tests, it is applicable to apps targeting open or closed source mobile platforms. In experiments conducted on 22 Android apps and 6 iOS apps, repairs produced by METER helped preserve 63.7% and 38.8% of all the test actions broken by the GUI changes, respectively.

6 February 2024
Verified
Conference Paper
Open access
YLYuanhong Lan
Yuanhong Lan
YLYifei Lu
Yifei Lu
ZLZhong Li
Zhong Li
MPMinxue Pan
Minxue Pan
WYWenhua Yang
Wenhua Yang
XLXuandong Li
Xuandong Li
As the scale and complexity of Android applications continue to grow in response to increasing market and user demands, quality assurance challenges become more significant. While previous studies have demonstrated the superiority of Reinforcement Learning (RL) in Android GUI testing, its effectiveness remains limited, particularly in large, complex apps. This limitation arises from the ineffectiveness of Tabular RL in learning the knowledge within the large state-action space of the App Under Test (AUT) and from the suboptimal utilization of the acquired knowledge when employing more advanced RL techniques. To address such limitations, this paper presents DQT, a novel automated Android GUI testing approach based on deep reinforcement learning. DQT preserves widgets' structural and semantic information with graph embedding techniques, building a robust foundation for identifying similar states or actions and distinguishing different ones. Moreover, a specially designed Deep Q-Network (DQN) effectively guides curiosity-driven exploration by learning testing knowledge from runtime interactions with the AUT and sharing it across states or actions. Experiments conducted on 30 diverse open-source apps demonstrate that DQT outperforms existing state-of-the-art testing approaches in both code coverage and fault detection, particularly for large, complex apps. The faults detected by DQT have been reproduced and reported to developers; so far, 21 of the reported issues have been explicitly confirmed, and 14 have been fixed.

12 March 2010 in Science of Computer Programming
Verified
Journal Article
Closed access
BLBin Lei
Bin Lei
XLXuandong Li
Xuandong Li
ZLZhiming Liu
Zhiming Liu
CMCharles Morisset
Charles Morisset
VSVolker Stolz
Volker Stolz

15 March 2024 in ACM Transactions on Software Engineering and Methodology
Verified
Journal Article
Open access
TZTingwei Zhu
Tingwei Zhu
ZLZhong Li
Zhong Li
MPMinxue Pan
Minxue Pan
CSChaoxuan Shi
Chaoxuan Shi
TZTian Zhang
Tian Zhang
XLXuandong Li
Xuandong Li
Code summarization aims to generate short functional descriptions for source code to facilitate code comprehension. While Information Retrieval (IR) approaches that leverage similar code snippets and corresponding summaries have led the early research, Deep Learning (DL) approaches that use neural models to capture statistical properties between code and summaries are now mainstream. Although some preliminary studies suggest that IR approaches are more effective in some cases, it is currently unclear how effective the existing approaches can be in general, where and why IR/DL approaches perform better, and whether the integration of IR and DL can achieve better performance. Consequently, there is an urgent need for a comprehensive study of the IR and DL code summarization approaches to provide guidance for future development in this area. This article presents the first large-scale empirical study of 18 IR, DL, and hybrid code summarization approaches on five benchmark datasets. We extensively compare different types of approaches using automatic metrics, we conduct quantitative and qualitative analyses of where and why IR and DL approaches perform better, respectively, and we also study hybrid approaches for assessing the effectiveness of integrating IR and DL. The study shows that the performance of IR approaches should not be underestimated, that while DL models perform better in predicting tokens from method signatures and capturing structural similarities in code, simple IR approaches tend to perform better in the presence of code with high similarity or long reference summaries, and that existing hybrid approaches do not perform as well as individual approaches in their respective areas of strength. Based on our findings, we discuss future research directions for better code summarization.

23 December 2023 in Frontiers of Computer Science
Verified
Journal Article
Closed access
PDF file
ZLZhong Li
Zhong Li
MPMinxue Pan
Minxue Pan
YPYu Pei
Yu Pei
TZTian Zhang
Tian Zhang
LWLinzhang Wang
Linzhang Wang
XLXuandong Li
Xuandong Li