Xiangying Dang

Xiangying Dang

orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
19 January 2021 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
XDXiangying Dang
Xiangying Dang
DGDunwei Gong
Dunwei Gong
XYXiangjuan Yao
Xiangjuan Yao
TTTian Tian
Tian Tian
HLHuai Liu
Huai Liu
Mutation testing, a fundamental software testing technique, which is a typical way to evaluate the adequacy of a test suite. In mutation testing, a set of mutants are generated by seeding the different classes of faults into a program under test. Test data shall be generated in the way that as many mutants can be killed as possible. Thanks to numerous tools to implement mutation testing for different languages, a huge amount of mutants are normally generated even for small-sized programs. However, a large number of mutants not only leads to a high cost of mutation testing, but also make the corresponding test data generation a non-trivial task. In this paper, we make use of intelligent technologies to improve the effectiveness and efficiency of mutation testing from two perspectives. A machine learning technique, namely fuzzy clustering, is applied to categorize mutants into different clusters. Then, a multi-population genetic algorithm via individual sharing is employed to generate test data for killing the mutants in different clusters in parallel when the problem of test data generation as an optimization one. A comprehensive framework, termed as $\mathbf {FUZGENMUT}$ , is thus developed to implement the proposed techniques. The experiments based on nine programs of various sizes show that fuzzy clustering can help to reduce the cost of mutation testing effectively, and that the multi-population genetic algorithm improves the efficiency of test data generation while delivering the high mutant-killing capability. The results clearly indicate that the huge potential of using intelligent technologies to enhance the efficacy and thus the practicality of mutation testing.

22 February 2023 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
QZQing Zhao
Qing Zhao
XYXiangjuan Yao
Xiangjuan Yao
XDXiangying Dang
Xiangying Dang
DGDunwei Gong
Dunwei Gong
It is of great significance to effectively and quickly identify the most influential users in the open source software community, which can be represented by a complex network. Traditional methods of measuring node influence only consider some topology characteristics of the network, so the results are one-sided. Because there are different interactive behaviors among users in the community, it is necessary to mine more interaction information, so as to give a more comprehensive measure of node influence. In view of this, this paper proposes a method to maximize the node influence of open source software community based on a probability propagation model. Firstly, according to the relationship of users and their interactive records on projects, this paper quantifies the feedback of users on the project from three aspects (i.e. approve, save and modify) and establishes a new probability propagation model between users. Secondly, this paper proposes an algorithm(SIUF) to evaluate users' influence in the open source software community based on the probability propagation model. The algorithm fully considers the interaction behavior of users in the community. In the first stage, the user's own activity is taken as the initial ranking. In the second stage, the influence of neighbor nodes is taken into account, and the SIUF value of nodes is accumulated while the rich club effect is weakened. Finally, the proposed theory and method are applied to GitHub, a typical open source software community, and the correctness and effectiveness of this method are verified from influence spread and speed.

6 January 2024 in Journal of Systems and Software
Verified
Journal Article
Closed access
XDXiangying Dang
Xiangying Dang
JWJinyong Wang
Jinyong Wang
DGDunwei Gong
Dunwei Gong
XYXiangjuan Yao
Xiangjuan Yao
CWChangqing Wei
Changqing Wei
BXBiao Xu
Biao Xu

9 June 2025 in Journal of Systems and Software
Verified
Journal Article
Closed access
LTLei Tao
Lei Tao
XDXiangying Dang
Xiangying Dang
JHJuxin Hu
Juxin Hu
DGDunwei Gong
Dunwei Gong
GHGuosheng Hao
Guosheng Hao
BHBingsen Huang
Bingsen Huang

5 August 2020 in IEEE Access
Verified
Journal Article
Open access
XDXiangying Dang
Xiangying Dang
XYXiangjuan Yao
Xiangjuan Yao
DGDunwei Gong
Dunwei Gong
TTTian Tian
Tian Tian
BSBaicai Sun
Baicai Sun
Mutation testing is a powerful software testing technique. However, it is difficult to obtain test data for killing a large number of mutants, especially for hard-to-kill mutants. Mutant branch is formed by an original statement of a program under test and its mutated statement. The true branch of a mutant branch is covered by a test datum, suggesting the corresponding mutant is killed under the criterion of weak mutation testing. This article focuses on efficiently generating test data for a large number of mutant branches. When generating test data using a search-based method, the size of the search domain is a determining factor affecting the search performance. The key observation is that only partial input variables affect whether a mutant will be killed, so the search domain can be reduced by deleting irrelevant variables. Along this line, we first group the mutant branches based on their relevant input variables, followed by formulating a multi-task optimization model of test data generation for the grouped mutant branches, in which the relevant input variables are taken as the decision variables. Finally, a multi-population genetic algorithm with individual sharing is employed to generate test data by multi-tasking. The experiments based on eight programs of various sizes show that removing related variable helps reduce the search domain, and the efficiency of test data generation by grouping and multitasking is improved.

16 September 2013 in Journal of Computer Applications
Verified
Journal Article
Closed access
XDXiangying Dang
Xiangying Dang
RBRong Bao
Rong Bao
DJDaihong Jiang
Daihong Jiang