Xiaoxing Ma

Xiaoxing Ma

Auto-generated profile, based on publicly available information

Xiaoxing Ma

State Key Lab for Novel Software Technology, Nanjing University, Nanjing, China

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

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

Representative Publications

View All Publications
9 September 2011
Verified
Conference Paper
Open access
PDF file
XMXiaoxing Ma
Xiaoxing Ma
LBLuciano Baresi
Luciano Baresi
CGCarlo Ghezzi
Carlo Ghezzi
VMValerio Panzica La Manna
Valerio Panzica La Manna
JLJian Lu
Jian Lu
There is an increasing demand for the runtime reconfiguration of distributed systems in response to changing environments and evolving requirements. Reconfiguration must be done in a safe and low-disruptive way. In this paper, we propose version consistency of distributed transactions as a safe criterion for dynamic reconfiguration. Version consistency ensures that distributed transactions be served as if there were operating on a single coherent version of the system despite possible reconfigurations that may happen meanwhile. The paper also proposes a distributed algorithm to maintain dynamic dependences between components at architectural level and enable low-disruptive version-consistent dynamic reconfigurations. An initial assessment through simulation shows the benefits of the proposed approach with respect to timeliness and low degree of disruption.

20 January 2021 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
YZYu Zhou
Yu Zhou
XYXinying Yang
Xinying Yang
TCTaolue Chen
Taolue Chen
ZHZhiqiu Huang
Zhiqiu Huang
XMXiaoxing Ma
Xiaoxing Ma
HGHarald Gall
Harald Gall
Developers often need to use appropriate APIs to program efficiently, but it is usually a difficult task to identify the exact one they need from a vast list of candidates. To ease the burden, a multitude of API recommendation approaches have been proposed. However, most of the currently available API recommenders do not support the effective integration of user feedback into the recommendation loop. In this paper, we propose a framework, BRAID ( B oosting R ecommend A tion with I mplicit Fee D back), which leverages learning-to-rank and active learning techniques to boost recommendation performance. By exploiting user feedback information, we train a learning-to-rank model to re-rank the recommendation results. In addition, we speed up the feedback learning process with active learning. Existing query-based API recommendation approaches can be plugged into BRAID. We select three state-of-the-art API recommendation approaches as baselines to demonstrate the performance enhancement of BRAID measured by Hit@k (Top-k), MAP, and MRR. Empirical experiments show that, with acceptable overheads, the recommendation performance improves steadily and substantially with the increasing percentage of feedback data, comparing with the baselines.

1 February 2013 in Pervasive and Mobile Computing
Verified
Journal Article
Closed access
PYPing Yu
Ping Yu
XMXiaoxing Ma
Xiaoxing Ma
JCJiannong Cao
Jiannong Cao
JLJian Lu
Jian Lu

1 September 2017
Verified
Conference Paper
Closed access
TGTianxiao Gu
Tianxiao Gu
CCChun Cao
Chun Cao
TLTianchi Liu
Tianchi Liu
CSChengnian Sun
Chengnian Sun
JDJing Deng
Jing Deng
JLJian Lu
Jian Lu
Activities are the fundamental components of Android applications (apps). However, existing approaches to automated testing for Android apps cannot effectively manage the transitions between activities, e.g., too rarely or too often. Besides, some techniques need to repeatedly restart from scratch and revisit every intermediate activity to reach a specific one, which leads to unnecessarily long transitions and wasted time. To address these problems, we propose AimDroid, a practical model-based approach to automated testing for Android apps that aims to manage the exploration of activities and meantime minimize unnecessary transitions between them. Specifically, AimDroid applies an activity-insulated multi-level strategy during testing and replaying. It systematically discovers unexplored activities and then intensively exploits every discovered individual with a reinforcement learning guided random algorithm. We conduct comprehensive experiments on 50 popular closed-source commercial apps that in total have billions of daily usages in China. The results demonstrate that AimDroid outperforms both Sapienz and Monkey in activity, method and instruction coverage, respectively. In addition, AimDroid also reports more crashes than the other two.

27 October 2024
Verified
Conference Paper
Open access
GWGuangyuan Wu
Guangyuan Wu
WCWeining Cao
Weining Cao
YYYuan Yao
Yuan Yao
HWHengfeng Wei
Hengfeng Wei
TCTaolue Chen
Taolue Chen
XMXiaoxing Ma
Xiaoxing Ma
Loop invariant inference, a key component in program verification, is a challenging task due to the inherent undecidability and complex loop behaviors in practice. Recently, machine learning based techniques have demonstrated impressive performance in generating loop invariants automatically. However, these methods highly rely on the labeled training data, and are intrinsically random and uncertain, leading to unstable performance. In this paper, we investigate a synergy of large language models (LLMs) and bounded model checking (BMC) to address these issues. The key observation is that, although LLMs may not be able to return the correct loop invariant in one response, they usually can provide all individual predicates of the correct loop invariant in multiple responses. To this end, we propose a "query-filter-reassemble" strategy, namely, we first leverage the language generation power of LLMs to produce a set of candidate invariants, where training data is not needed. Then, we employ BMC to identify valid predicates from these candidate invariants, which are assembled to produce new candidate invariants and checked by off-the-shelf SMT solvers. The feedback is incorporated into the prompt for the next round of LLM querying. We expand the existing benchmark of 133 programs to 316 programs, providing a more comprehensive testing ground. Experimental results demonstrate that our approach significantly outperforms the state-of-the-art techniques, successfully generating 309 loop invariants out of 316 cases, whereas the existing baseline methods are only able to tackle 219 programs at best. The code is publicly available at https://github.com/SoftWiser-group/LaM4Inv.git.

27 April 2015 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
WSWei Song
Wei Song
HJHans-Arno Jacobsen
Hans-Arno Jacobsen
CYChunyang Ye
Chunyang Ye
XMXiaoxing Ma
Xiaoxing Ma
Process mining, especially process discovery, has been utilized to extract process models from event logs. One challenge faced by process discovery is to identify concurrency effectively. State-of-the-art approaches employ activity orders in traces to undertake process discovery and they require stringent completeness notions of event logs. Thus, they may fail to extract appropriate processes when event logs cannot meet the completeness criteria. To address this problem, we propose in this paper a novel technique which leverages activity dependences in traces. Based on the observation that activities with no dependencies can be executed in parallel, our technique is in a position to discover processes with concurrencies even if the logs fail to meet the completeness criteria. That is, our technique calls for a weaker notion of completeness. We evaluate our technique through experiments on both real-world and synthetic event logs, and the conformance checking results demonstrate the effectiveness of our technique and its relative advantages compared with state-of-the-art approaches.