Xiangjuan Yao

Learn More
Though mutation testing has been widely studied for more than thirty years, the prevalence and properties of equivalent mutants remain largely unknown. We report on the causes and prevalence of equivalent mutants and their relationship to stubborn mutants (those that remain undetected by a high quality test suite, yet are non-equivalent). Our results, based(More)
Path-oriented test data generation is an important issue of software testing, but the efficiency of existing methods needs to be further improved. We focus on the problem of generating test data for many paths coverage, and present a method of evolutionary generation of test data for many paths coverage based on grouping. First, target paths are divided(More)
In this paper, some new families of integral trees with diameters 4, 6 and 8 are given. All these classes are infinite. They are different from those in the existing literature. We also prove that the problem of finding integral trees of diameters 4, 6 and 8 is equivalent to the problem of solving Pell’s diophantine equations. The discovery of these(More)
Let G be a 2-edge-connected simple graph on n ≥ 13 vertices and A an (additive) abelian group with |A| ≥ 4. In this paper, we prove that if for every uv 6∈ E(G), max{d(u), d(v)} ≥ n/4, then eitherG is A-connected orG can be reduced to one of K2,3, C4 and C5 by repeatedly contracting proper A-connected subgraphs, where Ck is a cycle of length k. We also show(More)
The application of genetic algorithms in automatically generating test data has become a research hotspot and produced many results in recent years. However, its applicability is limited in the presence of flag variables. This issue, known as the flag problem, has been studied by many researchers to date. We propose a novel method of testability(More)
Context: As a fault-based testing technique, mutation testing is effective at evaluating the quality of existing test suites. However, a large number of mutants result in the high computational cost in mutation testing. As a result, mutant reduction is of great importance to improve the efficiency of mutation testing. Objective: We aim to reduce mutants for(More)
The application of genetic algorithms in automatically generating test data has aroused broad concerns and obtained delightful achievements in recent years. However, the efficiency of genetic algorithm-based test data generation for path testing needs to be further improved. In this paper, we establish a mathematical model of generating test data for(More)
Let G be an undirected graph, A be an (additive) abelian group and A∗ = A−{0}. A graph G is A-connected if G has an orientation D(G) such that for every function b : V (G) → A satisfying ∑v∈V (G) b(v) = 0, there is a function f : E(G) → A∗ such that ∑e∈E+(v) f(e) − ∑ e∈E−(v) f(e) = b(v). For an abelian group A, let 〈A〉 be the family of graphs that are(More)