CN112699053A - Software testing method integrated with fuzzy clustering - Google Patents
Software testing method integrated with fuzzy clustering Download PDFInfo
- Publication number
- CN112699053A CN112699053A CN202110051696.0A CN202110051696A CN112699053A CN 112699053 A CN112699053 A CN 112699053A CN 202110051696 A CN202110051696 A CN 202110051696A CN 112699053 A CN112699053 A CN 112699053A
- Authority
- CN
- China
- Prior art keywords
- variants
- variant
- similarity
- test
- fuzzy clustering
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/36—Preventing errors by testing or debugging software
- G06F11/3668—Software testing
- G06F11/3672—Test management
- G06F11/3684—Test management for test design, e.g. generating new test cases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
Abstract
The invention discloses a software testing method integrated with fuzzy clustering, aiming at applying the fuzzy clustering method to software testing, clustering variants simulating real defects based on similarity, and only detecting similar defects once to improve the efficiency of software defect detection; firstly, generating variants based on a weak variation test criterion, and calculating the similarity between the variants by adopting a mathematical statistics method; then constructing a similarity matrix, finally, sequencing the variants based on the number of the variants similar to the variants, and then fuzzy clustering the variants based on the similarity among the variants, so that the non-central variants are distributed into a plurality of clusters, which is favorable for improving the efficiency of generating test data; the fuzzy clustering method is beneficial to reducing the cost of variation test; the method has great potential for improving the effectiveness and the practicability of the variation test.
Description
Technical Field
The invention relates to the field of computer software testing, and designs a software testing method integrated with fuzzy clustering. The method is different from the original method in that the fuzzy clustering method is applied to software testing, the variants simulating real defects are clustered based on similarity, similar defects only need to be detected once, and the efficiency of software defect detection is improved.
Background
Software testing is an effective way to improve the quality of software products. The software quality is more and more paid attention and concerned by people, the software test is an important means for ensuring the software quality, and through the test, not only can the possible defects of the software be detected, but also the reliability of the software can be improved. The variation test has the obvious advantages of strong debugging capability, convenience, flexibility, high automation degree and the like, and is widely used for evaluating the sufficiency of a test data set and the effectiveness of a software test technology
The mutation test is to insert the real defect of the simulation software into the original program, and the program inserted with the defect is called as a variant; the statement after the change is called a variant statement; and respectively executing the original program and the variant by using the same test input, if certain test data can distinguish the original program from the variant from an execution result, the variant is called to be killed based on a strong variation test criterion, and if the original program and the variant are executed at a variation point and the variable state is inconsistent, the variant is called to be killed based on a weak variation test criterion. The mutation score is the ratio of killed variants to non-equivalent variants and is used for evaluating the defect detection capability of the test data set, and the higher the mutation score is, the stronger the actual defect detection capability of the test data set is.
A program often has many variants, and in order to kill these variants, a large amount of test data is also required; moreover, in order to generate an effective test data set and kill variants to the maximum extent, the original program and variants must be repeatedly executed, which increases the cost of the variant test and seriously hinders the wide application thereof in software engineering, and therefore, a suitable method needs to be researched to improve the efficiency of the variant test.
Studies have shown that reducing the number of runs of variants is one of the effective ways to improve the efficiency of the variation test. Offutt et al selects representative operators for all operators to generate variants to reduce the number of variants that need to be killed. Mateo et al propose to reduce the number of variants by constructing additional code frames, studying the factors that affect the coverage of variants. In domestic research, the variants generated by similar mutation operators are reduced by the Chengzhou universities team, so that the variants needing to be killed are reduced. The Gongyun team judges the redundancy relation reduction variants among the variants through interval operation, and the consolidation team selects important variant test objects from the aspect of statement importance, reduces the number of variants generated, and groups the variants based on the similarity of the variants according to paths to perform efficient software test.
The clustering method is to classify the data based on data similarity under the unsupervised condition, wherein fuzzy clustering can effectively cluster data sample sets with cross between classes, and the obtained clustering result is obviously superior to a hard clustering method. The fuzzy clustering method is applied to the variation test, variants with high similarity can be classified into the same cluster, the variants are effectively reduced, and the execution cost of the variation test is reduced.
The domestic volitary team is dedicated to research on Software defects predicted based on machine learning, wherein research results based on a clustering method mainly include that a characteristic subset selection framework based on clustering analysis is published in a Computer Software and Applications conference in 2014, and a two-stage data set preprocessing method based on clustering defect prediction is published in a Software Security and Reliability conference; characteristic selection method based on cluster analysis in 'Chinese science' published software defect prediction in 2016, and research on static software defect prediction method in 'software science' published.
Hussain firstly adopts a clustering method to realize the reduction of the variant, and the clustering method used by Hussain comprises a K-means clustering algorithm and an agglomeration type hierarchical clustering algorithm. The method has the disadvantages that the number of clusters and the initial clustering center are difficult to determine in advance by adopting a K-means clustering algorithm, and the clusters cannot be corrected once being combined by adopting an agglomeration type hierarchical clustering algorithm, so that the clustering quality of the variants is influenced. Aiming at the problems, the topaz culvert provides clustering based on genetic algorithm improvement of variants, and the method can reduce the cost of variation test and greatly improve the reduction rate. However, in the above two methods, based on the strong mutation test criterion, the original program and the variants need to be executed by the test data, the calculation cost of the mutation test is still large, and the distance between the test data is not accurate enough as the similarity characteristic of the variants, and for some programs, the test data with a close distance may not necessarily kill the similar variants.
In view of the above analysis, the invention applies the fuzzy clustering and weak mutation testing technology to software testing, can enhance the software testing defect detection capability, reduce the cost of software testing, and is beneficial to the wide application of the mutation testing in the industry.
Disclosure of Invention
The invention provides a software testing method integrated with fuzzy clustering. Firstly, generating variants based on a weak variation test criterion, and calculating the similarity between the variants by adopting a mathematical statistics method; then, constructing a variant similarity matrix; finally, the variants are ranked based on the number of variants that are similar to the variants, and the clustered variants are blurred based on the similarity between the variants, such that non-central variants are assigned to the plurality of clusters.
The technical scheme adopted by the invention is as follows: a software testing method for integrating fuzzy clustering comprises the following steps:
step S1, calculating the similarity between variants
Setting a certain test program as G, inputting the program as X, and s as a certain original sentence in G, and performing mutation on the program to obtain a mutation sentence s'; satisfy the requirement "s!for mutation testing! I.e. meets weak mutation test criteria, where "! If not, then the conditional statement "if s! S' ″ and its true branch, called the variant branch based on weak variant test criteria, and its corresponding variant denoted as Mi(ii) a One variant corresponds to one variant branch; following the same procedure, a set of all variants was obtained, denoted as M ═ M1,M2,…,MnN is the number of variants; inserting the variant branches into the front of the corresponding original sentence in the G to form a new tested program which is marked as G'; x runs G', if "if is! The true branch of s' ″ is executed, then based on the weak mutation criterion MiIs killed;
to reflect that X killed variant MiCase, a random variable μ is definedi(X),
To calculate μi(X) a mathematical statistical method is adopted; first, a test case set is obtained, for which, R samples, denoted X, are randomly generated in the program G input domain1,X2,...,XR(ii) a Mixing XkK 1,2, …, R performs a procedure to see if it kills M under weak mutation test criteriaiThen calculating mui(Xk) A value of (d);
to cluster variants, the similarity between variants needs to be determined. Previous studies found that test data that killed a certain variant may also kill other variants, indicating that there is some association between variants and therefore, similarity between variants can be defined based on this association.
Hypothetical variant Mi,MjI, j 1,2, n, i ≠ j is two distinct variants, defining two random variables μi(Xk) And muj(Xk) They respectively reflect Mi,MjThe likelihood of being killed; then muj(Xk) The probability of 1 is expressed as:
Miand MjThe similarity between them is marked as alphai,jAnd can be represented by the following formula:
from the above formula, αi,j∈[0,1]。
Step S2 construction of variant similarity matrix
For all variants M1,M2,…,MnSimilarity between variants can be established, and a similarity matrix lambda is recorded as:
M1 M2 Mj Mn
step S3 fuzzy clustering variants
Let i cluster be CiAt the beginning ofLet the threshold be recorded as T e (0,1), and MiNumber of similar variants etaiThe initial value is 0;
s32: investigation of M in LambdaiN, M, i 1,2iAnd each Mj,Mj∈M,j=1,2,...,n,Mj≠MiAlpha of (A)i,jValue if αi,j≥T,ηi=ηi+1;
S33: based on eta1,η2,…,ηnDescending order of M1,M2,…,Mn(ii) a Outputting the sequenced variant sequence, and recording as M'1,M'2,…,M'nAnd the ordered set is denoted as S ═ M'1,M'2,…,M'n};
S34: the variable i is 1;
s37: examine inThe corresponding row of the image data is displayed,and Mj,Mj∈M,j=1,2,...,n,Alpha of (A)i,jValue if αi,jNot less than T, M may bejPlacing in CiThereby obtaining theCentered clusterWherein | ciL is the number of elements in the cluster,is the kth element in the ith cluster;
S39:i=i+1;
s310: judging whether variants exist in S, and if so, switching to S34;
s311: export variant clusters, denoted C1,C2,…CmWhereinM is the number of clusters for the cluster center of each cluster.
The invention has the beneficial effects that:
(1) the invention applies the fuzzy clustering method to the variation test to carry out variant clustering, and can improve the efficiency of software test defect detection. When a variation test is carried out, a plurality of variants are often used, one variant represents a defect, and similar variants can be grouped into the same class in order to improve the capability of detecting the defect, so that the variants in the same cluster can be killed at the same time.
(2) The invention provides a method for calculating the similarity of variants. One variant is a program, and the similarity between programs is difficult to directly measure. Therefore, the similarity between variants can be measured by executing their test data, i.e. the similarity of variants is determined by taking the probability that the test data killing one variant kills other variants as the mathematical statistics.
(3) The invention provides a cluster center which is the most similar variant to other variants and is beneficial to killing variants in the same cluster at the same time.
Drawings
FIG. 1 is a general flowchart of a software testing method incorporating fuzzy clustering according to the present invention;
FIG. 2 is an example program in an embodiment of the invention;
FIG. 3 is a similarity matrix between variants;
Detailed Description
For further explanation of the details and advantages of the present invention, reference is now made to the accompanying drawings.
As shown in fig. 1, it is a general flowchart of a software testing method incorporating fuzzy clustering proposed by the present invention. The method comprises the following steps:
step S1, calculating the similarity between variants
Setting a certain test program as G, inputting the program as X, and s as a certain original sentence in G, and performing mutation on the program to obtain a mutation sentence s'; satisfy the requirement "s!for mutation testing! I.e. meets weak mutation test criteria, where "! If not, then the conditional statement "if s! S' ″ and its true branch, called the variant branch based on weak variant test criteria, and its corresponding variant denoted as Mi(ii) a One variant corresponds to one variant branch; following the same procedure, a set of all variants was obtained, denoted as M ═ M1,M2,…,MnN is the number of variants; inserting the variant branches into the front of the corresponding original sentence in the G to form a new tested program which is marked as G'; x runs G', if "if is! The true branch of s' ″ is executed, then based on the weak mutation criterion MiIs killed;
to reflect that X killed variant MiCase, a random variable μ is definedi(X),
To calculate μi(X) a mathematical statistical method is adopted; first, a test case set is obtained, for which, R samples, denoted X, are randomly generated in the program G input domain1,X2,...,XR(ii) a Mixing XkK 1,2, …, R performs a procedure to see if it kills M under weak mutation test criteriaiThen calculating mui(Xk) A value of (d);
to cluster variants, the similarity between variants needs to be determined. Previous studies found that test data that killed a certain variant may also kill other variants, indicating that there is some association between variants and therefore, similarity between variants can be defined based on this association.
Hypothetical variant Mi,MjI, j 1,2, n, i ≠ j is two distinct variants, defining two random variables μi(Xk) And muj(Xk) They respectively reflect Mi,MjThe likelihood of being killed; then muj(Xk) The probability of 1 is expressed as:
Miand MjThe similarity between them is marked as alphai,jAnd can be represented by the following formula:
from the above formula, αi,j∈[0,1]。
Step S2 construction of variant similarity matrix
For all variants M1,M2,…,MnSimilarity between variants can be established, and a similarity matrix lambda is recorded as:
M1 M2 Mj Mn
step S3 fuzzy clustering variants
Let i cluster be CiAt the beginning ofLet the threshold be recorded as T e (0,1), and MiNumber of similar variants etaiThe initial value is 0;
s32: investigation of M in LambdaiN, M, i 1,2iAnd each Mj,Mj∈M,j=1,2,...,n,Mj≠MiAlpha of (A)i,jValue if αi,j≥T,ηi=ηi+1;
S33: based on eta1,η2,…,ηnDescending order of M1,M2,…,Mn(ii) a Outputting the sequenced variant sequence, and recording as M'1,M'2,…,M'nAnd the ordered set is denoted as S ═ M'1,M'2,…,M'n};
S34: the variable i is 1;
s35: selecting a head element M 'from S'1As a cluster center, M1' is represented asUpdate clusters to
s37: examine inThe corresponding row of the image data is displayed,and Mj,Mj∈M,j=1,2,...,n,Alpha of (A)i,jValue if αi,jNot less than T, M may bejPlacing in CiThereby obtaining theCentered clusterWherein | ciL is the number of elements in the cluster,is the kth element in the ith cluster;
S39:i=i+1;
s310: judging whether variants exist in S, and if so, switching to S34;
s311: export variant clusters, denoted C1,C2,…CmWhereinM is the number of clusters for the cluster center of each cluster.
Analysis of test examples:
the source code of the triangle classifier is shown in FIG. 2 (a). Fig. 2(b) shows a new program, in which 30 variant branches generated based on the weak variant test rule are inserted, and their variant set is M ═ M1,M2,...,M30}。
The similarity between variants is calculated according to equation (2). For example, if there are 170 test cases killing M based on weak mutation test criteria1Then 7 of these test cases can kill M2And 170 test case kills M5. Based on the formula (4) can be obtainedAnd alpha1,5When 1, obviously, M1And M5Has a similarity higher than M1And M2The similarity of (c).
Similarly, the similarity between all variants can be obtained and the similarity matrix is constructed as Λ, as shown in fig. 3.
Variants are ordered below. For each variant, the number of high correlations with other variants was counted, based on Λ. Let T equal to 0.5, e.g. M24Examine line 24 α of Λi,jMore than or equal to 0.5 element, and statistics shows that 13 variants (including self) and M are present24The correlation is greater than 0.5.
Table 1 ordered variants
Below, cluster variants are blurred. As can be seen from Table 1, the most relevant variant M was found24As C1Cluster center of, immediately after M24Removed from M and S. Then, according to the similarity matrix Λ, consider M24With other variantsBecause of the similarity of M14And M3,M5,M11,M12,M13,M15,M16,M17All the similarity is greater than T ═ 0.5, and they are put into C1. Then, M is added3,M5,M11,M12,M13,M15,M16And M17Is removed from S. Thus, the first cluster is obtained:
C1={M24,M1,M5,M6,M8,M11,M12,M13,M20,M21,M22,M23,M26}
in S, M21And M26Is the second and third elements because it has been classified as C1They cannot do clustering centers, so element M is chosen as the head in S15As cluster C2The cluster center of (2). Repeating the above process untilFinally, 9 variant clusters can be obtained, which are respectively:
C1={M24,M1,M5,M6,M8,M11,M12,M13,M20,M21,M22,M23,M26}
C2={M15,M3,M5,M11,M12,M13,M21,M25,M26,M28,M29,M30}
C3={M19,M3,M5,M11,M12,M13,M21,M25,M26,M28,M29,M30}
C4={M6,M3,M5,M8,M11,M12,M13,M25,M27,M28,M29}
C5={M2,M1,M4,M5,M11,M12,M13,M25,M27,M28}
C6={M20,M1,M5,M11,M12,M13,M18,M20,M21,M22,M23,M26}
C7={M7,M3,M10,M11,M12,M13,M25,M27,M28}
C8={M14,M3,M5,M11,M12,M13,M15,M16,M17}
C9={M9,M3,M5,M10}
the above examples show that the method of the present invention can accurately group similar variants together, thereby improving the efficiency of software testing.
Claims (3)
1. A software testing method integrated into fuzzy clustering is characterized in that: the method comprises the following steps:
setting a certain test program as G, inputting the program as X, and s as a certain original sentence in G, and performing mutation on the program to obtain a mutation sentence s'; satisfy the requirement "s!for mutation testing! I.e. meets weak mutation test criteria, where "! If not, then the conditional statement "if s! S' ″ and its true branch, called the variant branch based on weak variant test criteria, and its corresponding variant denoted as Mi(ii) a One variant corresponds to one variant branch; following the same procedure, a set of all variants was obtained, denoted as M ═ M1,M2,…,MnN is the number of variants; inserting the variant branches into the front of the corresponding original sentence in the G to form a new tested program which is marked as G'; x runs G', if "if is! The true branch of s' ″ is executed, then, based on the weak varianceDifferent criteria MiIs killed;
step S1: calculating the similarity between the variants;
step S2: constructing a variant similarity matrix, for all variants M1,M2,…,MnSimilarity between the variants can be established to form a similarity matrix Lambda;
step S3: fuzzy clustering variants:
let i cluster be CiAt the beginning ofLet the threshold be recorded as T e (0,1), and MiNumber of similar variants etaiThe initial value is 0;
s32: investigation of M in LambdaiN, M, i 1,2iAnd each Mj,Mj∈M,j=1,2,...,n,Mj≠MiAlpha of (A)i,jValue if αi,j≥T,ηi=ηi+1;
S33: based on eta1,η2,…,ηnDescending order of M1,M2,…,Mn(ii) a Outputting the sequenced variant sequence, and recording as M'1,M′2,…,M′nAnd the ordered set is denoted as S ═ M'1,M′2,…,M′n};
S34: the variable i is 1;
s37: examine inThe corresponding row of the image data is displayed,and Mj,Mj∈M,j=1,2,...,n,Alpha of (A)i,jValue if αi,jNot less than T, M may bejPlacing in CiThereby obtaining theCentered clusterWherein | ciL is the number of elements in the cluster,is the kth element in the ith cluster;
S39:i=i+1;
s310: judging whether variants exist in S, and if so, switching to S34;
2. The software testing method integrated into fuzzy clustering according to claim 1, wherein: the method for calculating the similarity between the variants in step S1 includes:
defining a random variable mui(X) reflects that X kills variant MiSituation(s)
Calculating mu by adopting a mathematical statistic methodi(X) first, a test case set is obtained, for which R samples, denoted X, are randomly generated in the program G input domain1,X2,...,XR(ii) a Mixing XkK 1,2, …, R performs a procedure to see if it kills M under weak mutation test criteriaiThen calculating mui(Xk) A value of (d);
then, the hypothetical variant Mi,MjI, j 1,2, n, i ≠ j is two distinct variants, defining two random variables μi(Xk) And muj(Xk) Respectively reflect Mi,MjThe likelihood of being killed; then muj(Xk) The probability of 1 is expressed as:
Miand MjThe similarity between them is marked as alphai,jAnd can be represented by the following formula:
from the above formula, αi,j∈[0,1]。
3. The software testing method integrated into fuzzy clustering according to claim 1, wherein: the method for constructing the variant similarity matrix in the step S2 includes:
for all variants M1,M2,…,MnEstablishing a variant similarity matrix lambda according to the similarity between the variants, and recording the similarity matrix lambda as:
Applications Claiming Priority (8)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202010770405 | 2020-08-03 | ||
CN2020107704059 | 2020-08-03 | ||
CN2020110724024 | 2020-10-09 | ||
CN202011072411 | 2020-10-09 | ||
CN2020110724113 | 2020-10-09 | ||
CN2020110728345 | 2020-10-09 | ||
CN202011072402 | 2020-10-09 | ||
CN202011072834 | 2020-10-09 |
Publications (2)
Publication Number | Publication Date |
---|---|
CN112699053A true CN112699053A (en) | 2021-04-23 |
CN112699053B CN112699053B (en) | 2022-02-22 |
Family
ID=75513622
Family Applications (9)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110051670.6A Active CN112732583B (en) | 2020-08-03 | 2021-01-14 | Software test data generation method based on clustering and multi-population genetic algorithm |
CN202110028395.6A Withdrawn CN112699045A (en) | 2020-08-03 | 2021-01-14 | Software test case generation method based on multi-population genetic algorithm |
CN202110051668.9A Active CN112699051B (en) | 2020-08-03 | 2021-01-14 | Variant grouping method based on relevant input variables |
CN202110051667.4A Withdrawn CN112732582A (en) | 2020-08-03 | 2021-01-14 | Software test case evolution generation method based on search domain reduction |
CN202110051669.3A Active CN112699052B (en) | 2020-08-03 | 2021-01-14 | Software test case evolution generation method based on relevant input variables |
CN202110051666.XA Withdrawn CN112699050A (en) | 2020-08-03 | 2021-01-14 | Multi-population evolution generation method for software test case based on variant grouping |
CN202110051697.5A Active CN112699054B (en) | 2020-08-03 | 2021-01-14 | Ordered generation method for software test cases |
CN202110028394.1A Withdrawn CN112732577A (en) | 2020-08-03 | 2021-01-14 | Evolution generation method for multi-task software test case |
CN202110051696.0A Active CN112699053B (en) | 2020-08-03 | 2021-01-14 | Software testing method integrated with fuzzy clustering |
Family Applications Before (8)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110051670.6A Active CN112732583B (en) | 2020-08-03 | 2021-01-14 | Software test data generation method based on clustering and multi-population genetic algorithm |
CN202110028395.6A Withdrawn CN112699045A (en) | 2020-08-03 | 2021-01-14 | Software test case generation method based on multi-population genetic algorithm |
CN202110051668.9A Active CN112699051B (en) | 2020-08-03 | 2021-01-14 | Variant grouping method based on relevant input variables |
CN202110051667.4A Withdrawn CN112732582A (en) | 2020-08-03 | 2021-01-14 | Software test case evolution generation method based on search domain reduction |
CN202110051669.3A Active CN112699052B (en) | 2020-08-03 | 2021-01-14 | Software test case evolution generation method based on relevant input variables |
CN202110051666.XA Withdrawn CN112699050A (en) | 2020-08-03 | 2021-01-14 | Multi-population evolution generation method for software test case based on variant grouping |
CN202110051697.5A Active CN112699054B (en) | 2020-08-03 | 2021-01-14 | Ordered generation method for software test cases |
CN202110028394.1A Withdrawn CN112732577A (en) | 2020-08-03 | 2021-01-14 | Evolution generation method for multi-task software test case |
Country Status (1)
Country | Link |
---|---|
CN (9) | CN112732583B (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113590474A (en) * | 2021-07-12 | 2021-11-02 | 山东建筑大学 | Method and system for judging persistent variant of parallel program |
CN114091622A (en) * | 2021-12-07 | 2022-02-25 | 西安邮电大学 | Variant reduction method based on self-organizing mapping neural network |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113342662A (en) * | 2021-06-11 | 2021-09-03 | 南京工业大学 | AI system software model variation technology oriented to neuron characteristics |
CN114461535B (en) * | 2022-04-14 | 2022-07-12 | 山东建筑大学 | Parallel mutation operator-oriented obstinate variant test data generation method and system |
CN115248781B (en) * | 2022-09-22 | 2022-12-27 | 西南科技大学 | Combined test case generation method, device, equipment and readable storage medium |
CN115617700B (en) * | 2022-12-19 | 2023-04-07 | 华东交通大学 | Test case design and generation method and system based on relational analysis |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080306980A1 (en) * | 2001-05-15 | 2008-12-11 | Daniela Brunner | Method for Predicting Treatment Classes Using Animal Behavior Informatics |
CN105808426A (en) * | 2016-02-28 | 2016-07-27 | 徐州工程学院 | Path coverage test data generation method used for weak mutation test |
CN105930272A (en) * | 2016-04-22 | 2016-09-07 | 中国矿业大学 | Important statement-based branch coverage testing data generation method |
CN107729241A (en) * | 2017-10-12 | 2018-02-23 | 中国矿业大学 | A kind of software mutation testing data evolution generation method based on variant packet |
CN111274119A (en) * | 2018-12-05 | 2020-06-12 | 徐州工程学院 | Variation test data generation method based on multi-population coevolution |
Family Cites Families (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080052690A1 (en) * | 2006-08-08 | 2008-02-28 | Microsoft Corporation | Testing software with a build engine |
US8589736B2 (en) * | 2011-08-12 | 2013-11-19 | Tata Consultancy Services Limited | System and method for automatic test data generation for relational testing |
CN103593287B (en) * | 2013-10-30 | 2016-08-17 | 北京信息控制研究所 | A kind of data links case automatic generating method based on genetic algorithm |
CN103559129B (en) * | 2013-10-31 | 2016-08-17 | 中国矿业大学 | Statistical regression test data generating method based on genetic algorithm |
CN103605605B (en) * | 2013-11-21 | 2016-05-25 | 中国矿业大学 | Based on the be dominant high-order mutation testing method of relation and two-stage genetic algorithm of statement |
CN103973511A (en) * | 2014-04-28 | 2014-08-06 | 南京邮电大学 | Service vulnerability test method based on message combination variation |
US10854315B2 (en) * | 2015-02-09 | 2020-12-01 | 10X Genomics, Inc. | Systems and methods for determining structural variation and phasing using variant call data |
CN105302719B (en) * | 2015-10-26 | 2017-11-28 | 北京科技大学 | A kind of mutation testing method and device |
CN105868116B (en) * | 2016-04-15 | 2018-07-24 | 西北工业大学 | Test cases technology based on semantic variation operator and optimization method |
JP6572168B2 (en) * | 2016-04-22 | 2019-09-04 | 日本電信電話株式会社 | Test data generation program and test data generation method |
EP3388994A1 (en) * | 2017-04-12 | 2018-10-17 | Siemens Aktiengesellschaft | Method and apparatus for computer-assisted testing of a blockchain |
CN107590313A (en) * | 2017-08-14 | 2018-01-16 | 天津大学 | Optimal inspection vector generation method based on genetic algorithm and analysis of variance |
CN108664391B (en) * | 2018-03-13 | 2021-03-23 | 北京邮电大学 | Program state-oriented fault classification method, variation testing method and device |
CN108763055B (en) * | 2018-04-19 | 2020-08-25 | 北京航空航天大学 | Construction method of test case constraint control technology based on epigenetic inheritance |
CN110399285B (en) * | 2018-04-24 | 2022-11-15 | 西安邮电大学 | Test case reduction method based on weak mutation analysis |
CN109542783B (en) * | 2018-11-19 | 2021-07-09 | 北京航空航天大学 | Extended finite-state machine test data generation method based on variable segmentation |
US10956133B2 (en) * | 2018-11-28 | 2021-03-23 | International Business Machines Corporation | Static optimization of production code for dynamic profiling |
WO2020136880A1 (en) * | 2018-12-28 | 2020-07-02 | 三菱電機株式会社 | Test execution device, test execution method, and test execution program |
CN111352830B (en) * | 2020-01-06 | 2023-10-24 | 中国矿业大学 | Variation test data evolution generation method based on statement dominance relation |
CN111563044B (en) * | 2020-05-11 | 2022-10-25 | 西安邮电大学 | Program spectrum error positioning method based on program variation |
-
2021
- 2021-01-14 CN CN202110051670.6A patent/CN112732583B/en active Active
- 2021-01-14 CN CN202110028395.6A patent/CN112699045A/en not_active Withdrawn
- 2021-01-14 CN CN202110051668.9A patent/CN112699051B/en active Active
- 2021-01-14 CN CN202110051667.4A patent/CN112732582A/en not_active Withdrawn
- 2021-01-14 CN CN202110051669.3A patent/CN112699052B/en active Active
- 2021-01-14 CN CN202110051666.XA patent/CN112699050A/en not_active Withdrawn
- 2021-01-14 CN CN202110051697.5A patent/CN112699054B/en active Active
- 2021-01-14 CN CN202110028394.1A patent/CN112732577A/en not_active Withdrawn
- 2021-01-14 CN CN202110051696.0A patent/CN112699053B/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080306980A1 (en) * | 2001-05-15 | 2008-12-11 | Daniela Brunner | Method for Predicting Treatment Classes Using Animal Behavior Informatics |
CN105808426A (en) * | 2016-02-28 | 2016-07-27 | 徐州工程学院 | Path coverage test data generation method used for weak mutation test |
CN105930272A (en) * | 2016-04-22 | 2016-09-07 | 中国矿业大学 | Important statement-based branch coverage testing data generation method |
CN107729241A (en) * | 2017-10-12 | 2018-02-23 | 中国矿业大学 | A kind of software mutation testing data evolution generation method based on variant packet |
CN111274119A (en) * | 2018-12-05 | 2020-06-12 | 徐州工程学院 | Variation test data generation method based on multi-population coevolution |
Non-Patent Citations (2)
Title |
---|
JOANNA STRUG等: "Using classification for cost reduction of applying mutation testing", 《2017 FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS (FEDCSIS)》 * |
梁冰等: "基于改进人工蜂群的核模糊聚类算法", 《计算机应用》 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113590474A (en) * | 2021-07-12 | 2021-11-02 | 山东建筑大学 | Method and system for judging persistent variant of parallel program |
CN113590474B (en) * | 2021-07-12 | 2022-03-22 | 山东建筑大学 | Method and system for judging persistent variant of parallel program |
CN114091622A (en) * | 2021-12-07 | 2022-02-25 | 西安邮电大学 | Variant reduction method based on self-organizing mapping neural network |
Also Published As
Publication number | Publication date |
---|---|
CN112699054B (en) | 2022-02-18 |
CN112699051A (en) | 2021-04-23 |
CN112699050A (en) | 2021-04-23 |
CN112699054A (en) | 2021-04-23 |
CN112699045A (en) | 2021-04-23 |
CN112699052A (en) | 2021-04-23 |
CN112699051B (en) | 2022-04-01 |
CN112732582A (en) | 2021-04-30 |
CN112699052B (en) | 2022-04-15 |
CN112732583A (en) | 2021-04-30 |
CN112732583B (en) | 2022-02-18 |
CN112699053B (en) | 2022-02-22 |
CN112732577A (en) | 2021-04-30 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN112699053B (en) | Software testing method integrated with fuzzy clustering | |
Mittas et al. | Ranking and clustering software cost estimation models through a multiple comparisons algorithm | |
CN110287439A (en) | A kind of network behavior method for detecting abnormality based on LSTM | |
CN110381079A (en) | Network log method for detecting abnormality is carried out in conjunction with GRU and SVDD | |
CN112756759B (en) | Spot welding robot workstation fault judgment method | |
CN111783818B (en) | Xgboost and DBSCAN-based accurate marketing method | |
Smith | The use of multivariate statistics within archaeobotany | |
Prudêncio et al. | Analysis of instance hardness in machine learning using item response theory | |
Beltrán et al. | Feature selection algorithms using Chilean wine chromatograms as examples | |
CN116578499A (en) | Intelligent analysis and test method and system for public component function change influence | |
CN113743572A (en) | Artificial neural network testing method based on fuzzy | |
WO2018162050A1 (en) | Tester and method for testing a device under test using relevance scores | |
Kulubekova et al. | A computational model of selection by consequences: Log survivor plots | |
CN112102882B (en) | Quality control system and method for NGS detection process of tumor sample | |
CN114048974A (en) | Artificial intelligent talent evaluation method, equipment and medium based on multi-scene simulation | |
CN113869973A (en) | Product recommendation method, product recommendation system, and computer-readable storage medium | |
Li et al. | Social network change detection using a genetic algorithm based back propagation neural network model | |
Olorisade et al. | Determining the effectiveness of three software evaluation techniques through informal aggregation | |
Farah et al. | Unsupervised learning for refactoring pattern detection | |
CN110334020B (en) | Redundancy variant identification method and identification device | |
Csalódi et al. | Integrated Survival Analysis and Frequent Pattern Mining for Course Failure-Based Prediction of Student Dropout. Mathematics 2021, 9, 463 | |
Gerick | Information Engineering with E-Learning Datasets | |
Snyder et al. | Sniff tests as a screen in the publication process: Throwing out the wheat with the chaff | |
CN116775495A (en) | Software testing method, system, storage medium and equipment based on time sequence | |
Zaini et al. | Implementation of Mahalanobis-Taguchi system to evaluate the normal and abnormal samples in academic faculties |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |