ψij | name |
i+j | First Zagreb index |
1√ij | Randić index |
2√iji+j | GA index |
√i+j−2ij | ABC index |
1√i+j | Sum–connectivity index |
(ij)3(i+j−2)3 | AZI index |
2i+j | Harmonic index |
|i−j| | Albertson index |
√i2+j2 | Sombor index |
iji+j | ISI index |
In software engineering, testing has long been a research area of software maintenance. Testing is extremely expensive, and there is no guarantee that all defects will be found within a single round of testing. Therefore, fixing defects that are not discovered by a single round of testing is important for reducing the test costs. During the software maintenance process, testing is conducted within the scope of a set of test cases called a test suite. Mutation testing is a method that uses mutants to evaluate whether the test cases of the test suite are appropriate. In this paper, an approach is proposed that uses the mutants of a mutation test to identify defects that are not discovered through a single round of testing. The proposed method simultaneously applies two or more mutants to a single program to define and record the relationships between different lines of code. In turn, these relationships are examined using the defects that were discovered by a single round of testing, and possible defects are recommended from among the recorded candidates. To evaluate the proposed method, a comparative study was conducted using the fault localization method, which is commonly employed in defect prediction, as well as the Defects4J defect prediction dataset, which is widely used in software defect prediction. The results of the evaluation showed that the proposed method achieves a better performance than seven other fault localization methods (Tarantula, Ochiai, Opt2, Barinel, Dstar2, Muse, and Jaccard).
Citation: Dong-Gun Lee, Yeong-Seok Seo. Identification of propagated defects to reduce software testing cost via mutation testing[J]. Mathematical Biosciences and Engineering, 2022, 19(6): 6124-6140. doi: 10.3934/mbe.2022286
[1] | Edil D. Molina, Paul Bosch, José M. Sigarreta, Eva Tourís . On the variable inverse sum deg index. Mathematical Biosciences and Engineering, 2023, 20(5): 8800-8813. doi: 10.3934/mbe.2023387 |
[2] | Mert Sinan Oz, Roberto Cruz, Juan Rada . Computation method of the Hosoya index of primitive coronoid systems. Mathematical Biosciences and Engineering, 2022, 19(10): 9842-9852. doi: 10.3934/mbe.2022458 |
[3] | William E. Fitzgibbon . The work of Glenn F. Webb. Mathematical Biosciences and Engineering, 2015, 12(4): v-xvi. doi: 10.3934/mbe.2015.12.4v |
[4] | V. R. Kulli, J. A. Méndez-Bermúdez, José M. Rodríguez, José M. Sigarreta . Revan Sombor indices: Analytical and statistical study. Mathematical Biosciences and Engineering, 2023, 20(2): 1801-1819. doi: 10.3934/mbe.2023082 |
[5] | Xinmei Liu, Xinfeng Liang, Xianya Geng . Expected Value of Multiplicative Degree-Kirchhoff Index in Random Polygonal Chains. Mathematical Biosciences and Engineering, 2023, 20(1): 707-719. doi: 10.3934/mbe.2023032 |
[6] | Saylé C. Sigarreta, Saylí M. Sigarreta, Hugo Cruz-Suárez . On degree–based topological indices of random polyomino chains. Mathematical Biosciences and Engineering, 2022, 19(9): 8760-8773. doi: 10.3934/mbe.2022406 |
[7] | Muhammad Akram, Adeel Farooq, Maria Shabir, Mohammed M. Ali Al-Shamiri, Mohammed M. Khalaf . Group decision-making analysis with complex spherical fuzzy N-soft sets. Mathematical Biosciences and Engineering, 2022, 19(5): 4991-5030. doi: 10.3934/mbe.2022234 |
[8] | Martin J. Blaser . Studying microbiology with Glenn F. Webb. Mathematical Biosciences and Engineering, 2015, 12(4): xvii-xxii. doi: 10.3934/mbe.2015.12.4xvii |
[9] | Wanlin Zhu, Minglei Fang, Xianya Geng . Enumeration of the Gutman and Schultz indices in the random polygonal chains. Mathematical Biosciences and Engineering, 2022, 19(11): 10826-10845. doi: 10.3934/mbe.2022506 |
[10] | Abdul Qadeer Khan, Azhar Zafar Kiyani, Imtiaz Ahmad . Bifurcations and hybrid control in a 3×3 discrete-time predator-prey model. Mathematical Biosciences and Engineering, 2020, 17(6): 6963-6992. doi: 10.3934/mbe.2020360 |
In software engineering, testing has long been a research area of software maintenance. Testing is extremely expensive, and there is no guarantee that all defects will be found within a single round of testing. Therefore, fixing defects that are not discovered by a single round of testing is important for reducing the test costs. During the software maintenance process, testing is conducted within the scope of a set of test cases called a test suite. Mutation testing is a method that uses mutants to evaluate whether the test cases of the test suite are appropriate. In this paper, an approach is proposed that uses the mutants of a mutation test to identify defects that are not discovered through a single round of testing. The proposed method simultaneously applies two or more mutants to a single program to define and record the relationships between different lines of code. In turn, these relationships are examined using the defects that were discovered by a single round of testing, and possible defects are recommended from among the recorded candidates. To evaluate the proposed method, a comparative study was conducted using the fault localization method, which is commonly employed in defect prediction, as well as the Defects4J defect prediction dataset, which is widely used in software defect prediction. The results of the evaluation showed that the proposed method achieves a better performance than seven other fault localization methods (Tarantula, Ochiai, Opt2, Barinel, Dstar2, Muse, and Jaccard).
In mathematics chemistry and biology, a chemical compound can be represented by a molecular graph by converting atoms to vertices and bonds to edges. One of the primary mission of QSAR/QSPR research is to accurately convert molecular graphs into numerical values. Graph theoretic invariants of molecular graphs are called molecular descriptors which can be utilized to simulate the structural information of molecules, in order to make worthwhile physical and chemical properties of these molecules can be acquired by single numerical values. Such kinds of molecular descriptors are also referred to as topological indices.
In the chemical literature, various topological indices relying only on vertex degrees of the molecular graphs can be utilized in QSPR/QSAR investigation on account of them can be obtained directly from the molecular architecture, and can be rapidly calculated for generous molecules (see [1,2]), and we call them VDB (vertex–degree–based) topological indices. To be more precise, for designated nonnegative real numbers {ψij} (1≤i≤j≤n−1), a VDB topological index of a an n-order (molecular) graph G is expressed as
TI(G)=∑1≤i≤j≤n−1mijψij, | (1.1) |
where mij is the amount of edges connecting an i-vertex and a j-vertex of G. A great deal of well–known VDB topological indices can be obtained by different ψij in expression (1.1). We list some VDB topological indices in Table 1.
ψij | name |
i+j | First Zagreb index |
1√ij | Randić index |
2√iji+j | GA index |
√i+j−2ij | ABC index |
1√i+j | Sum–connectivity index |
(ij)3(i+j−2)3 | AZI index |
2i+j | Harmonic index |
|i−j| | Albertson index |
√i2+j2 | Sombor index |
iji+j | ISI index |
The first Zagreb index [3] is the very first VDB topological index, as powerful molecular structure-descriptors [2], Zagreb indices can describe the peculiarities of the degree of branching in molecular carbon-atom skeleton. Thereafter, many VDB topological indices have been put forward to simulate physical, chemical, biological, and other attributes of molecules [4,5,6,7]. In 2021, Gutman [8] introduced a new VDB topological index named as the Sombor index which has a linear correlation with the entropy and the enthalpy of vaporization of octanes [9]. Das et al., give sharp bounds for Sombor index of graphs by means of some useful graph parameters and they reveal the relationships between the Sombor index and Zagreb indices of graphs [10]. Recently, Steiner Gutman index was introduced by Mao and Das [11] which incorporate Steiner distance of a connected graph G. Nordhaus-Gaddum-type results for the Steiner Gutman index of graphs were given in [12]. In 2022, Shang study the Sombor index and degree-related properties of simplicial networks [13]. For more details of VDB topological indices, one can see [3,14,15,16,17,18,19,20,21,22,23,24,25,26] and the books [27,28,29].
Fluoranthene is a eminent conjugated hydrocarbon which abound in coal tar [30]. A fluoranthene–type benzenoid system (f-benzenoid for short) is formed from two benzenoid units joined by a pentagon [31,32]. The ordinary structure modality of a f-benzenoid F is shown in Figure 1, where segments X and Y are two benzenoid systems. Each f-benzenoid possesses exactly one pentagon [32]. More and more attention is paid to f-benzenoids after the flash vacuum pyrolysis experiments of these nonalternant polycyclic aromatic hydrocarbons [33].
In the whole article, the terminology and notation are chiefly derived from [34,35,36,37,38,39,40,41]. A vertex of degree k is called a k-vertex, and an edge linking a k-vertex and a j-vertex is designated as a (k,j)-edge. Let nk be the number of k-vertices and let mkj be the number of (k,j)-edges in the molecular graph G. A benzenoid system without internal vertices is said to be catacondensed. Analogously, a f-benzenoid F containing a unique internal vertex is referred to as catacatacondensed. We use h-hexagon benzenoid system (or h-hexagon f-benzenoid) to represent a benzenoid system (or f-benzenoid) containing h hexagons.
Let Lh represent the h-hexagon linear chain (as shown in Figure 2(a)). An f-benzenoid FLh (h≥3) obtaining from pieces X=L2 and Y=Lh−2 is named as f-linear chain (as shown in Figure 2(b)).
A fissure (resp. bay, cove, fjord and lagoon) of a f-benzenoid F is a path of degree sequences (2,3,2) (resp. (2,3,3,2), (2,3,3,3,2), (2,3,3,3,3,2) and (2,3,3,3,3,3,2)) on the perimeter of F (see Figure 3). Fissures, bays, coves, fjords and lagoons are said to be different kinds of inlets and their number are signified by f, B, C, Fj and L, respectively [32,37]. Inlets determine many electronic and topological properties of f-benzenoids. Then, it can be found that f+2B+3C+4FJ+5L is the number of 3-vertices on the perimeter of F. It is noted that lagoons cannot occur in the theory of benzenoid systems. For convenience, let r=f+B+C+Fj+L to represent the total number of inlets and b=B+2C+3Fj+4L is referred to as the quantity of bay regions, In addition, b is exactly the quantity of (3,3)-edges on the perimeter of F. It is obvious that b≥2 for any f-benzenoid F.
It is noted that any f-benzenoid F contains merely either 2-vertex or 3-vertex. The vertices not on the perimeter are said to be internal, and we use ni to represent their number.
Lemma 1.1. [32] Let F be an n-order, h-hexagon f-benzenoid with m edges and ni internal vertices. Then
(i) n=4h+5−ni;
(ii) m=5h+5−ni.
Lemma 1.2. [32] Let F be an n-order and h-hexagon f-benzenoid with r inlets, Then
(i) m22=n−2h−r;
(ii) m23=2r;
(iii) m33=3h−r.
From the perspective of mathematics and chemistry, finding the extremal values of some useful TI for significant classes of graphs is very interesting [14,19,23,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56].
As a matter of convenience, we use Γm to represent the collection of f-benzenoids containing exactly m edges. In [45], we derived extremal values for TI among all f-benzenoids with given order. It is noted that structure of f-benzenoids with given order is different from that of f-benzenoids with given number of edges. And we found that the technique for studying TI among all f-benzenoids with given order can not be used directly to investigate TI for all f-benzenoids with fixed number of edges. For this reason, we concentrate on the research of extremal values for TI among all f-benzenoids with given size.
The main idea of this work is to construct f-benzenoids owning maximal r and minimal h at the same time in Γm depending on the number m is congruent to 0,1,2,3 or 4 modulo 5. By making use of this technique, we obtain the extremum of TI over Γm and characterize their corresponding graphs on the basis of m is congruent to 0,1,2,3 or 4 modulo 5. Afterwards the extremums of some well-known TI over Γm can be got by use of the previous results.
The structure of this paper is as below. We first determine the maximal r in the set Γm in Section 2. By utilizing these results, we find the extremum of several famed TI over Γm in Section 3.
We will find the f-benzenoids with maximal r in Γm in this section. Figure 4 illustrates three f-benzenoids pertaining to Γ42.
At first, we try to obtain the maximum and minimum number of hexagons in any F∈Γm.
The spiral benzenoid system [57] Th is a benzenoid system whose structure is in a "spiral" manner as illustrated in Figure 5. Th has maximal ni in all h-hexagon benzenoid systems.
As a matter of convenience, let SHh (h≥3) represent the collection of f-benzenoids formed by two spiral benzenoids X and Y. Particularly, a f-spiral benzenoid is a f-benzenoid F∗∈SHh in which X=Th−1 and Y=T1 (as shown in Figure 6). It is easy to see that that
ni(F∗)=2h−⌈√12(h−1)−3⌉. |
In [40], we proved that for every F′∈SHh (h≥3), the inequality
ni(F′)≤ni(F∗) | (2.1) |
holds, and the following graph operations were introduced.
Operation 1. For any h-hexagon f-benzenoid F having two segments X and Y, let h1=h(X) and h2=h(Y). By substituting spiral benzenoid systems Th1 and Th2 for X and Y, severally, another f-benzenoid F′∈SHh can be obtained (as shown in Figure 7).
For any h-hexagon f-benzenoid F, when h=3, it is easily checked that
ni(F)=1=2×3−⌈√12(3−1)−3⌉. | (2.2) |
When h≥4, let h1=h(X) and h2=h(Y). Another F′∈SHh (as shown in Figure 7) in which X=Th1 and Y=Th2 can be acquired by applying Operation 1 to F. It is apparently that ni(X)≤ni(Th1), ni(Y)≤ni(Th2), therefore
ni(F)=ni(X)+ni(Y)+1≤ni(Th1)+ni(Th2)+1=ni(F′). | (2.3) |
So, the following Lemma can be deduced by Eqs (2.1) and (2.3).
Lemma 2.1. [41] Let F be an h(h≥3)-hexagon f-benzenoid. Then
ni(F)≤2h−⌈√12(h−1)−3⌉, | (2.4) |
and the equality is established when F is F∗.
For any F∈Γm, h(F) over Γm is variable. Sharp bounds for h(F) in Γm is given below.
Theorem 2.1. For any f-benzenoid F∈Γm,
⌈15(m−4)⌉≤h(F)≤m−1−⌈13(2m+√4m−31)⌉, | (2.5) |
where ⌈x⌉ is the smallest integer larger or equal to x.
Proof. On one hand, from Lemma 1.1 (ii) we know that m=5h(F)+5−ni(F). Combining the fact that ni(F)≥1 for any F∈Γm, we get
h(F)≥⌈15(m−4)⌉. |
On the other hand, by Lemma 2.1 we know that ni(F)≤ni(F∗). Consequently, from m=5h(F)+5−ni(F) we have
m−3h(F)−5≥⌈√12(h(F)−1)−3⌉≥√12(h(F)−1)−3. |
Hence,
(3h(F)+(3−m))2≥4m−31. |
Due to the fact that 3h(F)+(3−m)<0, we deduce
3h(F)+(3−m)≤−√4m−31, |
i.e., h(F)≤m−1−⌈13(2m+√4m−31)⌉.
Remark 1. Theorem 2.1 implies that f-spiral benzenoid F∗ has the maximal number of hexagons over Γm.
For the sake of obtaining the extremum TI among all f-benzenoids in Γm, we need to find the f-benzenoids F∈Γm possessing maximal r.
Recall that convex benzenoid systems (CBS for brevity) are a particular sort of benzenoid systems lack of bay regions [14]. Let HSh be the collection of benzenoid systems containing h hexagons.
Lemma 2.2. [42] Let H∈HSh. Under the below cases, H is definitely not a CBS:
(i) If h≥4 and ni=1;
(ii) If h≥5 and ni=2;
(iii) If h≥6 and ni=3.
Lemma 2.3. [52] Let H∈HSh such that ni(H)=4. Then H is bound to embody a subbenzenoid system given in Figure 8, there does not exist hexagons which are adjacent to fissures.
Lemma 2.4. Let S∈HSh. If h≥7 and ni(S)=4, then S is not a CBS.
Proof. Let S be an h (h≥7)-hexagon benzenoid system, ni(S)=4, then by Lemma 2.3 S must contain one of the benzenoid systems of the form given in Figure 7. The proof is carried out in two cases.
Case 1. If these four internal vertices form a path P4 or a K1,3, then S contains one of benzenoid systems (d)–(f) in Figure 7 as its subbenzenoid systems. It is noted that h≥7, by Lemma 2.2, it must not exist hexagons contiguous to the fissures, so, S has at least one hexagon contiguous to a (2,2)-edge, by means of such hexagons, it is succeeded in converting one of the fissures into a cove, bay or fjord. Hence, b(S)≥1.
Case 2. If these four internal vertices are not adjacent then S has possibility subbenzenoid systems as follows.
1) There exist one type (a) and one type (c) benzenoid systems in S;
2) There exist two type (b) benzenoid systems in S;
3) There exist two type (a) and one type (b) benzenoid systems in S.
4) There exist four type (a) benzenoid systems in S
By Lemma 2.2, neither hexagons may be adjacent to the fissures in any of the cases indicated above. Since h≥7, S has at least one hexagon contiguous to a (2,2)-edge, by means of such hexagons, it is succeeded in making one of the fissures become a cove, bay or fjord. Therefore, b(S)≥1.
The proof is completed.
Lemma 2.5. [45] Let F be an h-hexagon f-benzenoid. Then
1) If ni=1, then r(F)≤r(FLh)=2h−3 (h≥3);
2) If ni=2, then r(F)≤r(Gh)=2h−4 (h≥4);
3) If ni=3, then r(F)≤r(Rh)=2h−5 (h≥5);
4) If ni=4, then r(F)≤r(Zh)=2h−6 (h≥6).
Next we find the f-benzenoids with maximal r in Γm with a fixed ni. Recall that Mh, Nh and Qh (see Figure 9) are benzenoid systems, and Gh (see Figure 10), Rh (see Figure 11), Zh (see Figure 12) are f-benzenoids.
Lemma 2.6. [41] Let F be an h-hexagon f-benzenoid. Then
r(F)≤r(FLh)=2h−3. |
Lemma 2.7. [32] For any h-hexagon f-benzenoid including ni internal vertices and b bay regions, the number of (2,2)-edge and (2,3)-edge are m22=b+5,m23=4h−2ni−2b, respectively.
From Lemmas 1.2 (ii) and 8, we get
r=2h−ni−b | (2.6) |
Furthermore, by Lemma 1.1 (ii) and Eq (2.6), we deduce
r=m−3h−5−b | (2.7) |
Theorem 2.2. Let F be an h-hexagon f-benzenoid. If ni=5, then r(F)≤r(Uh)=2h−7 (h≥7).
Proof. Let h1=h(X) and h2=h(Y), X and Y are two segments of F. If ni=5, by the structure of f-benzenoid, equality ni(X)+ni(Y)=4 holds, so, we have the following five cases.
Case 1. ni(X)=1, ni(Y)=3, i.e., there exist one internal vertex and three internal vertices in X and Y, respectively.
Subcase 1.1. If h1=3, then X=M3.
Subcase 1.1.1. If h2=5, i.e., Y=Q5, then F is the f-benzenoid D1, D2 or D3 (see Figure 14). It is clear that r(F)=r(D1)=8≤2h−7, r(F)=r(D2)=7≤2h−7 or r(F)=r(D3)=8≤2h−7.
Subcase 1.1.2. If h2≥6, by Lemma 2.2 and the hypothesis that ni(Y)=3, Y is not a CBS, so b(Y)≥1. Furthermore, b(F)≥3, combining Eq (2.6) we obtain r=2h−ni−b≤2h−8<2h−7.
Subcase 1.2. If h1≥4, according to Lemma 2.2, X is definitely not a CBS, i.e., b(X)≥1.
Subcase 1.2.1. If h2=5, i.e., Y=Q5. It is clear that b(F)≥4, then Eq (2.6) deduces r≤2h−9<2h−7.
Subcase 1.2.2. If h2≥6, Y is definitely not not a CBS according to Lemma 2.2, so, b(Y)≥1. It is clear that b(F)≥5, consequently from Eq (2.6) we obtain r≤2h−10<2h−7.
Case 2. ni(X)=3 and ni(Y)=1.
Subcase 2.1. If h1=5, then X=Q5.
Subcase 2.1.1. If h2=3, i.e., Y=M3, then F is the f-benzenoid D4, D5, D6 (see Figure 14), or D7 (as shown in Figure 15). r(F)=r(D4)=8≤2h−7, r(F)=r(D5)=7≤2h−7, r(F)=r(D6)=8≤2h−7, r(F)=r(D7)=7≤2h−7.
Subcase 2.1.2. If h2≥4, Y is surely not a CBS in light of Lemma 2.2, i.e., b(X)≥1. Hence, we have b(F)≥4, it follows from Eq (2.6) that r≤2h−9<2h−7.
Subcase 2.2. If h1≥6, by Lemma 2.2, X is definitely not a CBS, hence b(X)≥1.
Subcase 2.2.1. If h2=3, i.e., Y=M3. We have b(F)≥4, and Eq (2.6) infers that r≤2h−9<2h−7.
Subcase 2.2.2. f h2≥4, by Lemma 2.2, Y is certainly not a CBS, i.e., b(X)≥1. Hence we have b(F)≥5, by Eq (2.6), r≤2h−10<2h−7.
Case 3. ni(X)=2, ni(Y)=2, i.e., X and Y both have two internal vertices.
Subcase 3.1. If h1=4, we note that ni(X)=2, so X must be the benzenoid system (b) in Figure 9.
Subcase 3.1.1. If h2=4, Y is surely the benzenoid system (b) in Figure 9 according to the hypothesis ni(Y)=2, therefore, F is D8 or D9 (as shown in Figure 15). We get r(F)=r(D8)=8<2h−7 or r(F)=r(D9)=7<2h−7.
Subcase 3.1.2. If h2≥5, by Lemma 2.2 and that ni(Y)=2, Y is not a CBS, so we know that b(X)≥1. Then b(F)≥4, by Eq (2.6) and the fact that ni=5, r≤2h−9<2h−7.
Subcase 3.2. If h2=4, we note that ni(Y)=2, so Y must be the benzenoid system (b) in Figure 8.
Subcase 3.2.1. If h1=4, X must also be the benzenoid system (b) in Figure 9. Hence, F is D8 or D9 (as shown in Figure 15). r(F)=r(D8)=8≤2h−7 or r(F)=r(D9)=7≤2h−7.
Subcase 3.2.2. If h1≥5, by Lemma 2.2 and ni(X)=2, X is definitely not a CBS, i.e., b(X)≥1. Hence, b(F)≥4, by Eq (2.6) and the fact that ni=5, we have r≤2h−9<2h−7.
Subcase 3.3. If h1≥5, h2≥5, it is noted that ni(X)=ni(Y)=2, neither X nor Y are definitely CBS according to Lemma 2.2. So, both b(X) and b(Y) are greater than 1. Hence, b(F)≥5, on the basis of Eq (2.6) we get r≤2h−10<2h−7.
Case 4. ni(X)=4 and ni(Y)=0, i.e., X contains four internal vertices, Y is a catacondensed benzenoid system.
Subcase 4.1. If h1=6, then X is the benzenoid system (d), (e) or (f) in Figure 9.
Subcase 4.1.1. If h2=1, F is the f-benzenoid D10, D11, D12 (see Figure 16), D13 (see Figure 17) or U7 (see Figure 12). r(F)=r(D10)=6≤2h−7, r(F)=r(D11)=6≤2h−7, r(F)=r(D12)=6≤2h−7, r(F)=r(D13)=6≤2h−7 or r(F)=r(U7)=7=2h−7.
Subcase 4.1.2. If h2≥2, we have b(F)≥2, by Eq (2.6), r≤2h−7.
Subcase 4.2. If h1≥7, in the light of Lemma 2.4, X is definitely not a CBS, hence b(Y)≥1. In this situation b(F)≥3, we get the inequality r≤2h−8<2h−7 according to Eq (2.6).
Case 5. ni(X)=0 and ni(Y)=4, i.e., X is a catacondensed benzenoid system, Y has four internal vertices.
Subcase 5.1. If h2=6, then Y is the benzenoid system (d), (e) or (f) in Figure 8.
Subcase 5.1.1. If h1=2, X must be the linear chain L2. In this event, F is D14, D15, D16, D17, D18, D19, D20 or D21 (see Figure 17). By further checking, we gain that r(F)=r(D14)=7≤2h−7, r(F)=r(D15)=8≤2h−7, r(F)=r(D16)=8≤2h−7, r(F)=r(D17)=7≤2h−7, r(F)=r(D18)=7≤2h−7, r(F)=r(D19)=8≤2h−7, r(F)=r(D20)=6≤2h−7 or r(F)=r(D21)=6≤2h−7.
Subcase 5.1.2. If h1≥3, bearing in mind that X is a catacondensed benzenoid system and Y is the benzenoid system (d), (e) or (f) in Figure 8, then F must have f-benzenoid D14, D15, D16, D17, D18, D19, D20 or D21 (see Figure 17) as its subgraph.
Subcase 5.1.2.1. If D14 is a subgraph in F, it is obvious that D14 has two coves. Since X is a catacondensed benzenoid system and h1≥3, F has at least one hexagon contiguous to a (2,2)-edge of X, and such hexagons can convert one fissure into a bay, or convert one cove into a fjord, or convert one fjord into a lagoon. In this instance b(F)≥4. Consequently, r≤2h−9<2h−7 can be got according to Eq (2.6).
Subcase 5.1.2.2. If D15, D16 or D19 is a subpart f-benzenoid in F, it is obvious each one of D15, D16 and D19 has a bay and a cove. Since X is a catacondensed benzenoid system and h1≥3, F contains at least one hexagon adjoining a (2,2)-edge of X, and such hexagons will make one fissure become a bay, or make one cove become a fjord, or make one fjord become a lagoon. Consequently, b(F)≥4, by Eq (2.6) it follows that r≤2h−9<2h−7.
Subcase 5.1.2.3. If D17 is a subpart f-benzenoid in F, it is obvious that D17 has a fjord and a bay. Since X is a catacondensed benzenoid system and h1≥3, F has at least one hexagon adjoining a (2,2)-edge of X, and such hexagons will convert one fissure into a bay, or convert one cove into a fjord, or convert one fjord into a lagoon. Consequently, b(F)≥4, by Eq (2.6) it follows that r≤2h−9<2h−7.
Subcase 5.1.2.4. If D18 is a subpart f-benzenoid in F, it is obvious that D18 has a fjord and two bays. Since X is a catacondensed benzenoid system and h1≥3, there exists has at least one hexagon adjoining a (2,2)-edge of X in F, and these hexagons will convert one of the fissures into a bay, or convert one cove into a fjord, or convert one fjord into a lagoon. Consequently, b(F)≥4, in light of Eq (2.6), r≤2h−9<2h−7.
Subcase 5.1.2.5. If D20 or D21 is a subpart f-benzenoid in F, it is obvious that both D20 and D21 have a bay and two fjords. Since X is a catacondensed benzenoid system and h1≥3, F contains at least one hexagon adjoining a (2,2)-edge of X, and such hexagons will make one fissure become a bay, or make one cove become a fjord, or make one fjord become a lagoon. Consequently, b(F)≥4, according to Eq (2.6), r≤2h−9<2h−7.
Subcase 5.2. If h2≥7, by Lemma 2.4 and the fact that ni(Y)=4, Y is certainly not a CBS, i.e., b(Y)≥1.
Subcase 5.2.1. If h1=2, i.e., X=L2. From the structure of f-benzenoid, F is formed from X and Y joined by a pentagon, it is easily seen that there are at least one bay or one cove arisen in the process of construction of F. It is clear that b(F)≥2, by Eq (2.6) we have r≤2h−7.
Subcase 5.2.2. If h1≥3, we know that F is formed by joining from X and Y through a pentagon, in this construction process of F, it is easily seen that there are at least one bay or one cove arisen. Then b(F)≥2, by Eq (2.6), r≤2h−7.
The proof is completed.
We recall that FLh is the f-linear chain with h hexagons [40]. Extremal f-benzenoids with maximal r in Γm were determined in the following theorem.
Theorem 2.3. Let F∈Γm. Then
1) If m≡0(mod5), then r(F)≤2m−355=r(Um5);
2) If m≡1(mod5), then r(F)≤2m−325=r(Zm−15);
3) If m≡2(mod5), then r(F)≤2m−295=r(Rm−25);
4) If m≡3(mod5), then r(F)≤2m−265=r(Gm−35);
5) If m≡4(mod5), then r(F)≤2m−235=r(FLm−45).
Proof. We know by Eq (2.5) that
⌈15(m−4)⌉≤h(F)≤m−1−⌈13(2m+√4m−31)⌉. |
1) If m≡0(mod5), then ⌈15(m−4)⌉=m5. If h=m5, then by Lemma 1.1 (ii)
m=5h(F)+5−ni(F)=m+5−ni(F), |
it means that ni(F)=5. Furthermore, Theorem 2.2 infers that r(F)≤r(Um5) and we are done. So assume now that h(F)≥m5+1, then by equality (2.7) and the fact that b(F)≥2
r(F)=m−5−3h(F)−b(F)≤m−5−3(m5+1)−b(F) |
≤2m5−10=2m−505≤2m−355=r(Um5). |
2) If m≡1(mod5), then ⌈15(m−4)⌉=m−15. If h(F)=m−15, then by Lemma 1.1 (ii)
m=5h(F)+5−ni(F)=m+4−ni(F), |
thus ni(F)=4. Then r(F)≤r(Zm−15) by part 4 of Lemma 2.5. Otherwise h(F)≥m−15+1, then by equality (2.7) and the obvious fact that b(F)≥2
r(F)=m−5−3h(F)−b(F)≤m−5−3(m−15+1)−b(F) |
≤2m+35−10=2m−475≤2m−325=r(Zm−15). |
3) If m≡2(mod5), then ⌈15(m−4)⌉=m−25. If h(F)=m−25, then by Lemma 1.1 (ii)
m=5h(F)+5−ni(F)=m+3−ni(F), |
and so ni(F)=3. Then r(F)≤r(Rm−25) by part 3 of Lemma 2.5. So assume now that h(F)≥m−25+1, then by Eq (2.7) and the fact that b(F)≥2
r(F)=m−5−3h(F)−b(F)≤m−5−3(m−25+1)−b(F) |
≤2m+65−10=2m−445≤2m−295=r(Rm−25). |
4) If m≡3(mod5), then ⌈15(m−4)⌉=m−35. If h(F)=m−35, then by Lemma 1.1 (ii)
m=5h(F)+5−ni(F)=m+2−ni(F), |
thus ni(F)=2. By Lemma 2.5, r(F)≤r(Gm−35) and we are done. If h(F)≥m−35+1, then by equality (2.7) and the fact that b(F)≥2
r(F)=m−5−3h(F)−b(F)≤m−5−3(m−35+1)−b(F) |
≤2m+95−10=2m−415≤2m−265=r(Gm−35). |
5) If m≡4(mod5), then ⌈15(m−4)⌉=m−45. Since h≥m−45 and b(F)≥2, then by Eq (2.7), we have
r(F)=m−5−3h(F)−b(F)≤m−5−3m−125−b(F) |
≤2m+125−7=2m−235=r(FLm−45). |
In this part, we attempt to find the extremal values of TI over Γm.
It is noted that a f-benzenoid F contains only 2-vertex and 3-vertex. Hence, equation (1.1) reduces to
TI(F)=m22ψ22+m23ψ23+m33ψ33, | (3.1) |
In the light of Lemmas 1.1 and 1.2,
TI(F)=ψ22m+3(ψ33−ψ22)h+(2ψ23−ψ22−ψ33)r, | (3.2) |
If U,V∈Γm then clearly
TI(U)−TI(V)=3(ψ33−ψ22)(h(U)−h(V)) +(2ψ23−ψ22−ψ33)(r(U)−r(V)). | (3.3) |
For convenience, we set s=ψ33−ψ22, q=2ψ23−ψ22−ψ33.
Theorem 3.1. For any F∈Γm, we have the following results.
a. If s≤0 and q≥0,
TI(F)≤{TI(Um5),if m≡0(mod 5)TI(Zm−15),if m≡1(mod 5)TI(Rm−25),if m≡2(mod 5)TI(Gm−35),if m≡3(mod 5)TI(FLm−45),if m≡4(mod 5) |
b. If s≥0 and q≤0,
TI(F)≥{TI(Um5),if m≡0(mod 5)TI(Zm−15),if m≡1(mod 5)TI(Rm−25),if m≡2(mod 5)TI(Gm−35),if m≡3(mod 5)TI(FLm−45),if m≡4(mod 5) |
Proof. Let F∈Γm. By Eq (2.5)
h(F)≥⌈15(m−4)⌉={h(Um5),if m≡0(mod 5)h(Zm−15),if m≡1(mod 5)h(Rm−25),if m≡2(mod 5)h(Gm−35),if m≡3(mod 5)h(FLm−45),if m≡4(mod 5) |
i.e., f-benzenoids Um5, Zm−15, Rm−25, Gm−35 and FLm−45 have minimal h over the set Γm. Meanwhile, by Theorem 2.3, we have
r(F)≤{r(Um5),if m≡0(mod 5)r(Zm−15),if m≡1(mod 5)r(Rm−25),if m≡2(mod 5)r(Gm−35),if m≡3(mod 5)r(FLm−45),if m≡4(mod 5) |
i.e., these five f-benzenoids have maximal number of inlets over Γm. Hence, for any f-benzenoids F∈Γm and V∈{Um5,Zm−15,Rm−25,Gm−35,FLm−45}, h(F)−h(V)≥0 and r(F)−r(V)≤0 hold simultaneously, from Eq (2.7), we have
TI(F)−TI(V)=3s(h(F)−h(V))+q(r(F)−r(V)). |
If s≤0 and q≥0, then TI(F)−TI(V)≤0, i.e., V reaches the maximum value of TI over Γm. If s≥0 and q≤0, then TI(F)−TI(V)≥0, i.e., V reaches the minimum value of TI over Γm. Furthermore, which V∈{Um5,Zm−15,Rm−25,Gm−35,FLm−45} is the extremal graph depending on m is congruent to 0,1,2,3 or 4 modulo 5.
Example 1. Values of s and q for several famous TI are listed in Table 2:
ij | 1√ij | 2√iji+j | 1√i+j | (ij)3(i+j−2)3 | √i+j−2ij | |
q | -1 | -0.0168 | -0.0404 | -0.0138 | -3.390 | 0.040 |
s | 5 | -0.1667 | 0 | -0.091 | 3.390 | -0.040 |
Therefore, the minimum extreme value of TI for the second Zagreb index, GA index and the AZI index can be determined in the light of Theorems 2.3 and 3.1, and we can obtain the maximum extreme value of TI for the ABC index.
If f-benzenoid F∈Γm, then from the Eqs (2.3) and (2.6) and Lemma 1.1(ii) we have
TI(F)=(2ψ23−ψ33)m+6(ψ33−ψ23)h−(2ψ23−ψ22−ψ33)b −5(2ψ23−ψ22−ψ33). | (3.4) |
Consequently, for f-benzenoids U,V∈Γm
TI(U)−TI(V)=6(ψ33−ψ23)(h(U)−h(V)) +(−2ψ23+ψ22+ψ33)(b(U)−b(V)). | (3.5) |
Set u=6(ψ33−ψ23) and keep in mind that q=2ψ23−ψ22−ψ33. Then
TI(U)−TI(V)=u(h(U)−h(V))−q(b(U)−b(V)). | (3.6) |
It is noted that Eq (3.6) can be decided only by h, b and the signs of u and q. For any F∈Γm, We know that
h(F)≤m−1−⌈13(2m+√4m−31)⌉, |
and the equality can be achieved precisely when F is the f-spiral benzenoid F∗ [41].
In [41], we proved that ni(F∗)=2h−⌈√12(h−1)−3⌉. But, b(F∗)≠2 may occur. It is noticeable if X in F∗ is a CBS, F∗ is a f-benzenoid satisfying that b(F∗)=2 or 3. For the sake of simplicity, Let N be the set of positive integers.
The CBS, W=H(l1,l2,l3,l4,l5,l6) (as shown in Figure 18), can be completely determined by the positive integers l1,l2,l3,l4 [14].
The following lemma gave requirements that there exists CBS with maximal ni [53].
Lemma 3.1. [53] Let h∈N. The conditions below are isovalent:
(a) There is a CBS W containing h hexagons and 2h+1−⌈√12h−3 ⌉ number of internal vertices.
(b) There exist l1,l2,l3,l4∈N satisfying the following equation
h=l1l3+l1l4+l2l3+l2l4−l2−l3−12l1(l1+1)−12l4(l4+1)+1⌈√12h−3 ⌉=l1+2l2+2l3+l4−3} | (3.7) |
If for h∈N, Eq (3.7) has a solution l1,l2,l3,l4∈N, then there is a CBS W meeting the conditions that ni(W)=ni(Th).
Now, we concentrate on the research for TI of f-benzenoids. For a h−1∈N, supposing that the system below
h−1=l1l3+l1l4+l2l3+l2l4−l2−l3−12l1(l1+1)−12l4(l4+1)+1⌈√12(h−1)−3 ⌉=l1+2l2+2l3+l4−3∃ li∈{l1,l2,l3,l4,l5,l6}, li=2} | (3.8) |
has a solution {l1,l2,l3,l4}, then a CBS Wh−1 containing ni(Wh−1)=2(h−1)+1−⌈√12(h−1)−3⌉ number of internal vertices exists. Note that li=2 in system (3.8), i.e., there exists one fissure on the side of li of Wh−1, let u,w,v in Figure 1 represent the three vertices of this fissure. Now, we obtain an f-spiral benzenoid F∗1 in which X=Wh−1 and Y=L1. It is obvious that
ni(F∗1)=2h−⌈√12(h−1)−3⌉ | (3.9) |
and b(F∗1)=2. (as shown in Figure 19)
Theorem 3.2. Let h−1∈N such that the Eq (3.8) has a solution, and m=3h+5+⌈√12(h−1)−3⌉. Then for any F∈Γm
1) TI(F∗1)≥TI(F), when u≥0 and q≥0;
2) TI(F∗1)≤TI(F), when u≤0 and q≤0.
Proof. From Lemma 1.1 (ii) and Eq (3.9), we have
m(F∗1)=5h+5−(2h−⌈√12(h−1)−3⌉)=3h+5+⌈√12(h−1)−3⌉ |
and so
h=m−1−⌈13(2m+√4m−31)⌉. |
It is obvious that b(F∗1)=2 and b(F)≥2 for any F∈Γm. Hence by Eq (3.6), we have
TI(F)−TI(F∗1)=u(h(F)−h(F∗1))−q(b(F)−b(F∗1)) |
=u[h(F)−(m−1−⌈13(2m+√4m−31)⌉)]−q[b(F)−2]. |
And by Eq (2.5)
h(F)≤m−1−⌈13(2m+√4m−31)⌉. |
If u≥0 and q≥0 then TI(F)−TI(F∗1)≤0, i.e., F∗1 achieves maximal TI in Γm. Similarly, if u≤0 and q≤0 then TI(F)−TI(F∗1)≥0, i.e., F∗1 obtains minimal TI in Γm.
Example 2. The values of u and q for some famous TI are listed in the following Table 3:
ij | 1√ij | 2√iji+j | 1√i+j | (ij)3(i+j−2)3 | √i+j−2ij | |
q | -1 | -0.0168 | -0.0404 | -0.0138 | -3.390 | 0.040 |
u | 18 | -0.449 | 0.121 | -0.233 | 20.344 | -0.242 |
Hence, by Theorem 3.1 we can deduce the minimal values of the Randć index and the the sum–connectivity index in f-spiral benzenoid F∗1 for those h such that Eq (3.8) holds.
Example 3. Take consideration of the generalized Randć index
Rα(G)=∑1≤i≤j≤n−1mij(ij)α, |
where α∈R. Note that
q=2(6α)−4α−9α=−4α((32)α−1)2≤0 |
for all α∈R. Moreover, s=9α−4α≥0 if and only if α≥0 if and only if u=6(9α−6α)≥0. Hence, by Theorem 3.1, the minimal value of Rα(G) is obtained for all α≥0, and for any α≤0, the minimal value of Rα(G) can be attained by the f-spiral benzenoid F∗1 for those h such that Eq (3.8) holds.
This work investigates extremum TI over the collection of f-benzenoids having same number of edges. In practical terms, there are many other types of very useful topological indices for instance graph energy [58,59,60,61,62], Wiener index [63], Randić energy [64], Wiener polarity index [65], incidence energy [66], Harary index [67], entropy measures [68,69] and HOMO-LUMO index [70]. So, determining these topological indices for f-benzenoids is going to be extraordinary fascinating.
It is noted that the current framework is for studying topological indices of deterministic networks. But random networks would be a very promising direction. In [71,72], the distance Estrada index of random graphs was discussed, and the author went deeply into (Laplacian) Estrada index for random interdependent graphs. So, studying VDB topological indices of random and random interdependent graphs is another interesting problem.
This work was supported by Ningbo Natural Science Foundation (No. 2021J234). The authors are very grateful to anonymous referees and editor for their constructive suggestions and insightful comments, which have considerably improved the presentation of this paper.
The authors declare there is no conflict of interest.
[1] |
R. H. Ur, R. Mushtaq, A. Palwasha, K. Mukhtaj, I. Nadeem, K. H. Ullah, Making the sourcing decision of software maintenance and information technology, IEEE Access, 9 (2021), 11492-11510. https://doi.org/10.1109/ACCESS.2021.3051023 doi: 10.1109/ACCESS.2021.3051023
![]() |
[2] |
F.S. Ana M, M. R. Chaudron, M. Genero, An industrial case study on the use of UML in software maintenance and its perceived benefits and hurdles, Empirical Software Eng., 23 (2018), 3281-3345. https://doi.org/10.1007/s10664-018-9599-4 doi: 10.1007/s10664-018-9599-4
![]() |
[3] |
E. Vahid, O. Bushehrian, G. Robles, Task assignment to counter the effect of developer turnover in software maintenance: A knowledge diffusion model, Inf. Software Technol., 143 (2022), 106786. https://doi.org/10.1016/j.infsof.2021.106786 doi: 10.1016/j.infsof.2021.106786
![]() |
[4] |
K. Jang, W. Kim, A method of activity-based software maintenance cost estimation for package software, J. Supercomput., 78 (2021), 8151-8171. https://doi.org/10.1007/s11227-020-03610-6 doi: 10.1007/s11227-020-03610-6
![]() |
[5] |
T. Masateru, M. Akito, M. Kenichi, O. Sawako, O. Tomoki, Analysis of work efficiency and quality of software maintenance using cross-company dataset, IEICE Trans. Inf. Syst., 104 (2021), 76-90. https://doi.org/10.1587/transinf.2020MPP0004 doi: 10.1587/transinf.2020MPP0004
![]() |
[6] | K.W. Kim, Y. Son, Software weakness evaluation method for secure software development, in Proceedings on 2021 International Conferences on Multimedia Information Technology and Applications, (2021), 322-325. |
[7] | C. Kim, D. Kim, H. Kang, Detecting defect in headlamp housing with machine learning techniques, in Proceedings on 2021 International Conferences on Multimedia Information Technology and Applications, (2021), 428-430. |
[8] |
Y. J. Choi, Y. W. Lee, B. G Kim, Residual-based graph convolutional network for emotion recognition in conversation for smart Internet of Things, Big Data, 9 (2021), 279-288. https://doi.org/10.1089/big.2020.0274 doi: 10.1089/big.2020.0274
![]() |
[9] |
P. P. Roy, P. Kumar, B.G. Kim, An efficient sign language recognition (SLR) system using Camshift tracker and hidden Markov model (hmm), SN Comput. Sci., 2 (2021), 1-15. https://doi.org/10.1007/s42979-021-00485-z doi: 10.1007/s42979-021-00485-z
![]() |
[10] | B. George, F. Stefan, M. Michael, P. Josef, An early investigation of unit testing practices of component-based software systems, in 2020 IEEE Workshop on Validation, Analysis and Evolution of Software Tests, (2020), 12-15. https://doi.org/10.1109/VST50071.2020.9051632 |
[11] | M. Alcon, H. Tabani, J. Abella, F. J. Cazorla, Enabling Unit Testing of Already-Integrated AI Software Systems: The Case of Apollo for Autonomous Driving, in 2021 24th Euromicro Conference on Digital System Design, (2021), 426-433. https://doi.org/10.1109/DSD53832.2021.00071 |
[12] | D. Xavier, S. Panichella, A. Gambi, Java unit testing tool competition: Eighth round, in Proceedings of the IEEE/ACM 42nd International Conference on Software Engineering Workshops, (2020), 545-548. https://doi.org/10.1145/3387940.3392265 |
[13] | T. Mengqing, J. Yan, W. Xiang, P. Rushu, Black-box approach for software testing based on fat-property, in MATEC Web of Conferences, 309 (2020), 02008. https://doi.org/10.1051/matecconf/202030902008 |
[14] | S. Bo, Y. Shao, C. Chen, Study on the automated unit testing solution on the linux platform, in 2019 IEEE 19th International Conference on Software Quality, Reliability and Security Companion, (2019), 358-361. https://doi.org/10.1109/QRS-C.2019.00073 |
[15] |
M. Héctor D, J. Gunel, S. Federica, T. Paolo, C. David, Diversifying focused testing for unit testing, ACM Trans. Software Eng. Method., 30 (2021), 1-24. https://doi.org/10.1145/3447265 doi: 10.1145/3447265
![]() |
[16] | X. Wang, L. Wei, B. Tao, S. Ji, A study about unit testing for embedded software of control system in nuclear power plant, in International Symposium on Software Reliability, Industrial Safety, Cyber Security and Physical Protection for Nuclear Power Plant, (2020), 157-163. https://doi.org/10.1007/978-981-16-3456-7_17 |
[17] |
F. Anfal A, R. G. Alsarraj, A. M. Altaie, Software cost estimation based on dolphin algorithm, IEEE Access, 8 (2020), 75279-75287. https://doi.org/10.1109/ACCESS.2020.2988867 doi: 10.1109/ACCESS.2020.2988867
![]() |
[18] |
C. Sonia, H. Singh, Optimizing design of fuzzy model for software cost estimation using particle swarm optimization algorithm, Int. J. Comput. Intell. Appl., 19 (2020), 2050005. https://doi.org/10.1142/S1469026820500054 doi: 10.1142/S1469026820500054
![]() |
[19] |
A. Farrukh, A review of machine learning models for software cost estimation, Rev. Comput. Eng. Res., 6 (2019), 64-75. https://doi.org/10.18488/journal.76.2019.62.64.75 doi: 10.18488/journal.76.2019.62.64.75
![]() |
[20] |
K. Ishleen, N. G. Singh, W. Ritika, J. Vishal, B. Anupam, Neuro fuzzy—COCOMO Ⅱ model for software cost estimation, Int. J. Inf. Technol., 10 (2018), 181-187. https://doi.org/10.1007/s41870-018-0083-6 doi: 10.1007/s41870-018-0083-6
![]() |
[21] |
J. Miller, S. Wienke, M. Schlottke-Lakemper, M. Meinke, M. S. Müller, Applicability of the software cost model COCOMO Ⅱ to HPC projects, Int. J. Comput. Sci. Eng., 17 (2018), 283-296. https://doi.org/10.1504/IJCSE.2018.095849 doi: 10.1504/IJCSE.2018.095849
![]() |
[22] | A. Asheeri, M. Mohd, M. Hammad, Machine learning models for software cost estimation, in 2019 International Conference on Innovation and Intelligence for Informatics, Computing, and Technologies, (2019), 1-6. https://doi.org/10.1109/3ICT.2019.8910327 |
[23] | A. Shaina, N. Mishra, Software cost estimation using artificial neural network, in Soft Computing: Theories and Applications, Springer, (2018), 51-58. https://doi.org/10.1007/978-981-10-5699-4_6 |
[24] |
S. S. Pratap, V. P. Singh, A. K. Mehta, Differential evolution using homeostasis adaption based mutation operator and its application for software cost estimation, J. King Saud Univ.-Comput. Inf. Sci., 33 (2021), 740-752. https://doi.org/10.1016/j.jksuci.2018.05.009 doi: 10.1016/j.jksuci.2018.05.009
![]() |
[25] |
S. W. Ahmad, G. R. Bamnote, Whale-crow optimization (WCO)-based optimal regression model for software cost estimation, Sādhanā, 44 (2019), 1-15. https://doi.org/10.1007/s12046-019-1085-1 doi: 10.1007/s12046-019-1085-1
![]() |
[26] |
J. A. Khan, S. U. R. Khan, J. Iqbal, I. U. Rehman, Empirical investigation about the factors affecting the cost estimation in global software development context, IEEE Access, 9 (2021), 22274-22294. https://doi.org/10.1109/ACCESS.2021.3055858 doi: 10.1109/ACCESS.2021.3055858
![]() |
[27] | V. S. Desai, R. Mohanty, ANN-Cuckoo optimization technique to predict software cost estimation, in 2018 Conference on Information and Communication Technology, (2018), 1-6. https://doi.org/10.1109/INFOCOMTECH.2018.8722380 |
[28] | R. C. A. Alves, D. A. G. Oliveira, G. A. N. Segura, C. B. Margi, The cost of software-defining things: A scalability study of software-defined sensor networks, IEEE Access 7 (2019), 115093-115108. https://doi.org/10.1109/ACCESS.2019.2936127 |
[29] | D. G. Lee, Y. S. Seo, Testing cost reduction using nested mutation testing, in Proceedings on 2021 International Conferences on Multimedia Information Technology and Applications, (2021), 462-464. |
[30] |
N. Li, M. Shepperd, Y. Guo, A systematic review of unsupervised learning techniques for software defect prediction, Inf. Software Technol., 122 (2020), 106287. https://doi.org/10.1016/j.infsof.2020.106287 doi: 10.1016/j.infsof.2020.106287
![]() |
[31] | F. Keller, L. Grunske, S. Heiden, A. Filieri, A. Hoorn, D. Lo, A critical evaluation of spectrum-based fault localization techniques on a large-scale software system, in 2017 IEEE International Conference on Software Quality, Reliability and Security, (2017), 114-125. https://doi.org/10.1109/QRS.2017.22 |
[32] | The cost of poor software quality in the US: A 2020 report, Report of Proc. Consortium Inf. Softw. QualityTM, 2021. Available from: https://www.disputesoft.com/wp-content/uploads/2021/01/CPSQ-2020-Software-Report.pdf. |
[33] | 'Fully weaponized' software bug poses a threat to Minecraft gamers and apps worldwide including Google, Twitter, Netflix, Spotify, Apple iCloud, Uber and Amazon, 2021. Available from: https://www.dailymail.co.uk/news/article-10297693/Global-race-patch-critical-computer-bug.html. |
[34] |
P. Vitharana, Defect propagation at the project-level: results and a post-hoc analysis on inspection efficiency, Empirical Software Eng., 22 (2017), 57-79. https://doi.org/10.1007/s10664-015-9415-3 doi: 10.1007/s10664-015-9415-3
![]() |
[35] | Z. Wei, T. Shen, X. Chen, Just-in-time defect prediction technology based on interpretability technology, in 2021 8th International Conference on Dependable Systems and Their Applications (DSA), (2021), 78-89. https://doi.org/10.1109/DSA52907.2021.00017 |
[36] | L. Ma, F. Zhang, J. Sun, M. Xue, B. Li, F. J. Xu, et al., Deepmutation: Mutation testing of deep learning systems, in 2018 IEEE 29th International Symposium on Software Reliability Engineering (ISSRE), (2018), 100-111. https://doi.org/10.1109/ISSRE.2018.00021 |
[37] | G. Petrovic, M. Ivankovic, B. Kurtz, P. Ammann, R. Just, An industrial application of mutation testing: Lessons, challenges, and research directions, in 2018 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), (2018), 47-53. https://doi.org/10.1109/ICSTW.2018.00027 |
[38] | Q. Hu, L. Ma, X. Xie, B. Yu, Y. Liu, J. Zhao, DeepMutation++: A mutation testing framework for deep learning systems, in 2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE), (2019), 1158-1611. https://doi.org/10.1109/ASE.2019.00126 |
[39] |
P. Gómez-Abajo, E. Guerra, J. D. Lara, M. G. Merayo, Wodel-Test: a model-based framework for language-independent mutation testing, Software Syst. Model., 20 (2021), 767-793. https://doi.org/10.1007/s10270-020-00827-0 doi: 10.1007/s10270-020-00827-0
![]() |
[40] | L. Chen, L. Zhang, Speeding up mutation testing via regression test selection: An extensive study, in 2018 IEEE 11th International Conference on Software Testing, Verification and Validation (ICST), (2018), 58-69. https://doi.org/10.1109/ICST.2018.00016 |
[41] | N. Humbatova, G. Jahangirova, P. Tonella, DeepCrime: mutation testing of deep learning systems based on real faults, in Proceedings of the 30th ACM SIGSOFT International, Symposium on Software Testing and Analysis, (2021), 67-78. https://doi.org/10.1145/3460319.3464825 |
[42] | K. Moran, M. Tufano, C. Bernal-Cárdenas, M. Linares-Vásquez, G. Bavota, C. Vendome, et al., MDroid+: A mutation testing framework for android, in 2018 IEEE/ACM 40th International Conference on Software Engineering: Companion (ICSE-Companion), (2018), 33-36. https://doi.org/10.1145/3183440.3183492 |
[43] | Z. Li, H. Wu, J. Xu, X. Wang, L. Zhang, Z. Chen, MuSC: A tool for mutation testing of ethereum smart contract, in 2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE), (2019), 1198-1201. https://doi.org/10.1109/ASE.2019.00136 |
[44] | D. Mao, L. Chen, L. Zhang, An extensive study on cross-project predictive mutation testing, in 2019 12th IEEE Conference on Software Testing, Validation and Verification (ICST), (2019), 160-171. https://doi.org/10.1109/ICST.2019.00025 |
[45] | D. Cheng, C. Cao, C. Xu, X. Ma, Manifesting bugs in machine learning code: An explorative study with mutation testing, in 2018 IEEE International Conference on Software Quality, Reliability and Security (QRS), (2018), 313-324. https://doi.org/10.1109/QRS.2018.00044 |
[46] | S. Lee, D. Binkley, R. Feldt, N. Gold, S. Yoo, Causal program dependence analysis, preprint, arXiv: 2104.09107. https://doi.org/10.48550/arXiv.2104.09107 |
[47] | S. Oh, S. Lee, S. Yoo, Effectively sampling higher order mutants using causal effect, in 2021 IEEE International Conference on Software Testing, Verification and Validation Workshops, (2021), 19-24. https://doi.org/10.1109/ICSTW52544.2021.00017 |
[48] |
X. Cai, Y. Niu, S. Geng, J. Zhang, Z. Cui, J. Li, et al., An under-sampled software defect prediction method based on hybrid multi-objective cuckoo search, Concurrency Comput.: Pract. Exper., 32 (2020), e5478. https://doi.org/10.1002/cpe.5478 doi: 10.1002/cpe.5478
![]() |
[49] | A. Rahman, J. Stallings, L. Williams, Defect prediction metrics for infrastructure as code scripts in DevOps, in Proceedings of the 40th International Conference on Software Engineering: Companion Proceeedings, (2018), 414-415. https://doi.org/10.1145/3183440.3195034 |
[50] | A. Amar, P. C. Rigby, Mining historical test logs to predict bugs and localize faults in the test logs, in 2019 IEEE/ACM 41st International Conference on Software Engineering. (2019), 140-151. https://doi.org/10.1109/ICSE.2019.00031 |
[51] |
P. Sangameshwar, B. Ravindran, Predicting software defect type using concept-based classification, Empirical Software Eng., 25 (2020), 1341-1378. https://doi.org/10.1142/S1469026820500054 doi: 10.1142/S1469026820500054
![]() |
[52] |
S. Wang, T. Liu, J. Nam, L. Tan, Deep semantic feature learning for software defect prediction, IEEE Trans. Software Eng., 46 (2018), 1267-1293. https://doi.org/10.1109/TSE.2018.2877612 doi: 10.1109/TSE.2018.2877612
![]() |
[53] |
X. Yin, L. Liu, H. Liu, Q. Wu, Heterogeneous cross-project defect prediction with multiple source projects based on transfer learning, Math. Biosci. Eng., 17 (2020), 1020-1040. https://doi.org/10.3934/mbe.2020054 doi: 10.3934/mbe.2020054
![]() |
[54] |
L. Qiao, X. Li, Q. Umer, P. Guo, Deep learning based software defect prediction, Neurocomputing, 385 (2020), 100-110. https://doi.org/10.1016/j.neucom.2019.11.067 doi: 10.1016/j.neucom.2019.11.067
![]() |
[55] |
F. Wu, X. Y. Jing, Y. Sun, J. Sun, L. Huang, F. Cui, et al., Cross-project and within-project semisupervised software defect prediction: A unified approach, IEEE Trans. Reliab., 67 (2018), 581-597. https://doi.org/10.1109/TR.2018.2804922 doi: 10.1109/TR.2018.2804922
![]() |
[56] |
D. L. Miholca, G. Czibula, I. G. Czibula, A novel approach for software defect prediction through hybridizing gradual relational association rules with artificial neural networks, Inf. Sci., 441 (2018), 152-170. https://doi.org/10.1016/j.ins.2018.02.027 doi: 10.1016/j.ins.2018.02.027
![]() |
[57] |
A. Majd, M. Vahidi-Asl, A. Khalilian, P. Poorsarvi-Tehrani, H. Haghighi, SLDeep: Statement-level software defect prediction using deep-learning model on static code features, Expert Syst. Appl., 147 (2020), 113156. https://doi.org/10.1016/j.eswa.2019.113156 doi: 10.1016/j.eswa.2019.113156
![]() |
[58] | G. G. Cabral, L. L. Minku, E. Shihab, S. Mujahid, Class imbalance evolution and verification latency in just-in-time software defect prediction, in 2019 IEEE/ACM 41st International Conference on Software Engineering (ICSE), (2019), 666-676. https://doi.org/10.1109/ICSE.2019.00076 |
[59] | A. Perez, R. Abreu, A. Deursen, A test-suite diagnosability metric for spectrum-based fault localization approaches, in 2017 IEEE/ACM 39th International Conference on Software Engineering, (2017), 654-664. https://doi.org/10.1109/ICSE.2017.66 |
[60] | X. Li, W. Li, Y. Zhang, L. Zhang, Deepfl: Integrating multiple fault diagnosis dimensions for deep fault localization, in Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis, (2019), 169-180. https://doi.org/10.1145/3293882.3330574 |
[61] |
A. Zakari, S. P. Lee, R. Abreu, B. H. Ahmed, R. A. Rasheed, Multiple fault localization of software programs: A systematic literature review, Inf. Software Technol., 124 (2020), 106312. https://doi.org/10.1016/j.infsof.2020.106312 doi: 10.1016/j.infsof.2020.106312
![]() |
[62] | Z. Li, Y. Wu, Y. Liu, An empirical study of bug isolation on the effectiveness of multiple fault localization, in 2019 IEEE 19th International Conference on Software Quality, Reliability and Security (QRS), (2019), 18-25. https://doi.org/10.1109/QRS.2019.00016 |
[63] | H. L. Ribeiro, R. P. A. de Araujo, M. L. Chaim, H. A. de Souza, F. Kon, Jaguar: A spectrum-based fault localization tool for real-world software, in 2018 IEEE 11th International Conference on Software Testing, Verification and Validation (ICST), (2018), 404-409. https://doi.org/10.1109/ICST.2018.00048 |
[64] | K. Liu, A. Koyuncu, T. F. Bissyandé, D. Kim, J. Klein, Y. Le Traon, You cannot fix what you cannot find! An investigation of fault localization bias in benchmarking automated program repair systems, in 2019 12th IEEE conference on software testing, validation and verification (ICST), (2019), 102-113. https://doi.org/10.1109/ICST.2019.00020 |
[65] |
D. Zou, J. Liang, Y. Xiong, M. D. Ernst, L. Zhang, An empirical study of fault localization families and their combinations, IEEE Trans. Software Eng., 47 (2019), 332-347. https://doi.org/10.1109/TSE.2019.2892102 doi: 10.1109/TSE.2019.2892102
![]() |
[66] |
J. Kim, J. Kim, E. Lee, Variable-based fault localization, Inf. Software Technol., 107 (2019), 179-191. https://doi.org/10.1016/j.infsof.2018.11.009 doi: 10.1016/j.infsof.2018.11.009
![]() |
[67] |
Y. Kim, S. Mun, S. Yoo, M. Kim, Precise learn-to-rank fault localization using dynamic and static features of target programs, ACM Trans. Software Eng. Method. (TOSEM), 28 (2019), 1-34. https://doi.org/10.1145/3345628 doi: 10.1145/3345628
![]() |
[68] | Defects4J, 2022. available from: https://github.com/rjust/defects4j. |
ψij | name |
i+j | First Zagreb index |
1√ij | Randić index |
2√iji+j | GA index |
√i+j−2ij | ABC index |
1√i+j | Sum–connectivity index |
(ij)3(i+j−2)3 | AZI index |
2i+j | Harmonic index |
|i−j| | Albertson index |
√i2+j2 | Sombor index |
iji+j | ISI index |
ij | 1√ij | 2√iji+j | 1√i+j | (ij)3(i+j−2)3 | √i+j−2ij | |
q | -1 | -0.0168 | -0.0404 | -0.0138 | -3.390 | 0.040 |
s | 5 | -0.1667 | 0 | -0.091 | 3.390 | -0.040 |
ij | 1√ij | 2√iji+j | 1√i+j | (ij)3(i+j−2)3 | √i+j−2ij | |
q | -1 | -0.0168 | -0.0404 | -0.0138 | -3.390 | 0.040 |
u | 18 | -0.449 | 0.121 | -0.233 | 20.344 | -0.242 |
ψij | name |
i+j | First Zagreb index |
1√ij | Randić index |
2√iji+j | GA index |
√i+j−2ij | ABC index |
1√i+j | Sum–connectivity index |
(ij)3(i+j−2)3 | AZI index |
2i+j | Harmonic index |
|i−j| | Albertson index |
√i2+j2 | Sombor index |
iji+j | ISI index |
ij | 1√ij | 2√iji+j | 1√i+j | (ij)3(i+j−2)3 | √i+j−2ij | |
q | -1 | -0.0168 | -0.0404 | -0.0138 | -3.390 | 0.040 |
s | 5 | -0.1667 | 0 | -0.091 | 3.390 | -0.040 |
ij | 1√ij | 2√iji+j | 1√i+j | (ij)3(i+j−2)3 | √i+j−2ij | |
q | -1 | -0.0168 | -0.0404 | -0.0138 | -3.390 | 0.040 |
u | 18 | -0.449 | 0.121 | -0.233 | 20.344 | -0.242 |