CN102063376A - Test case selection method - Google Patents
Test case selection method Download PDFInfo
- Publication number
- CN102063376A CN102063376A CN201110039023XA CN201110039023A CN102063376A CN 102063376 A CN102063376 A CN 102063376A CN 201110039023X A CN201110039023X A CN 201110039023XA CN 201110039023 A CN201110039023 A CN 201110039023A CN 102063376 A CN102063376 A CN 102063376A
- Authority
- CN
- China
- Prior art keywords
- test
- test case
- testing requirement
- class
- equivalence class
- 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
Abstract
The invention discloses a test case selection method, and belongs to the technical field of software testing. The method comprises the following steps of: 1, acquiring a reduced test requirement set through an original test requirement set; 2, designing test cases; and 3, sequencing the priorities of the test cases. The invention discloses a complete and high-efficiency test case selection process of reducing test requirements, generating the test cases, and generating a test sequence. The number of the generated test cases is greatly reduced on the premise of ensuring that expected test coverage is achieved; meanwhile, the priorities of the test cases are sequenced, so that the method has practical significance for testing large-scale software such as a web application program, and test efficiency is improved.
Description
Technical field
The present invention relates to the software testing technology field, particularly a kind of test case choosing method in the Web application software testing field.
Background technology
Software test is the means that improve software quality, and test case is to instruct the criterion of test in software test procedure.Test case is the description of the test activity relevant with test target carried out in sequence, determine " how " test.In software test work, the design of test case is extremely important, is the correctness of test execution, the basis of validity.How effectively design test case is the problem that the tester paid close attention to always.Along with software size is huge all the more, especially when the application software testing that carries out based on the Web platform, the test case quantity that needs is very huge, need a large amount of time and fund by the generation of manually finishing test case, can't satisfy the short period of Web performance history and the process of continuous iteration.The appearance of the automatic generation technique of test case has solved this difficult problem, has improved the saving of testing efficiency and fund, makes that the automaticity of test is higher.
Yet, automatically existing the test case of a lot of redundancies in the test case that generates, the existence of these test cases has reduced the progress and the efficient of test, makes the increase sharp increase along with test case quantity of the efficient of software test and cost.The sequence of test case has directly determined the order of software test, and the Different Effects of priority probability and the speed of finding defective.Based on this, how selecting test case effectively is to guarantee testing efficiency and even successful key factor.
People such as M.J.Harrold proposed the notion that test use cases is simplified first in 1993, people such as T.Y.Chen have provided a series of terms in the test use cases simplification problem again.Test use cases simplification problem is exactly at the coverage condition according to test use cases and testing requirement collection, obtains under the situation that covers the full test demand, finds minimum test use cases, and its redundant covering is less.At present, mainly concentrate on two aspects for the intensive Study on Technology that subtracts of test: one is based on the test use cases simplification technology that combination covers; Mainly contain heuristic and two research fields of algebraic method; Another test use cases that is based on testing requirement is simplified technical research, and people generally are according to each testing requirement, produce corresponding test case, uses various short-cut method, the test use cases after obtaining simplifying then on the test use cases basis.
In patent 20091020845.6, disclose particle cluster algorithm has been used in the test use cases simplification, with solving the problem that the regression test case collection expands.This patent adopts the 0-1 coded system to represent test use cases, different particles is represented the selection scheme of different test cases, the adaptive value of each particle adopts two adaptive values to estimate, a representative be all coverages of testing requirement of test use cases, another representative be the redundance that test use cases satisfies the demands, utilize each test case that the coverage rate of testing requirement is upgraded particle position in a body position of future generation for probability produces at random, obtain at last covering maximum and the particle of redundance minimum is optimum test case reduction scheme.
This patent disclosure its advantage of method be simple to operate, search speed is fast, does not rely on initial value.But this patent is to simplify from the angle of the test use cases that has generated, and has ignored this process of generation test case demand; Though the resulting test case of this patent is simplified, be not what optimize, the practical significance that test is produced a little less than.
Summary of the invention
To the objective of the invention is in order addressing the above problem, to propose a kind of test case choosing method.
A kind of test case choosing method is characterized in that, comprises following step:
Step 1:, obtain yojan testing requirement collection by original testing requirement collection;
Specifically comprise following step:
(1) the original testing requirement collection of initialization R is R={r
1, r
2... r
m, r wherein
iBe testing requirement, i=1,2 ... m, initialization yojan testing requirement collection R ' is
Initialization test demand k is
(2) whether the original testing requirement collection of cycle criterion R is empty, as then carrying out 8 for sky), otherwise carry out 3);
(3) take out any testing requirement r from original testing requirement collection R, make testing requirement k=r, this moment, original testing requirement collection was updated to R:=R-{r};
(4) the testing requirement r among the original testing requirement collection R of selection
i, 1 i of this step every execution of operation adds up 1 time, judges r simultaneously
iWhether be last testing requirement, if then carry out 7), if otherwise carry out 5);
(5) calculate testing requirement r
iWhether with the common factor of testing requirement k, judge occuring simultaneously simultaneously is empty, if for sky would carry out 4), if for sky would carry out 6);
(6) refresh test demand k makes k:=k ⌒ r
i, upgrade original testing requirement collection R, make R:=R-{r
i; Carry out 4)
(7) calculate yojan testing requirement collection R ', make R ' :=R '+{ k}; Carry out 2);
(8) obtain final yojan testing requirement collection R ';
Step 2: test case design;
According to the yojan testing requirement collection R ' after the yojan that obtains in the step 1,, adopt boundary value analysis method design test case according to the constraint condition between each testing requirement among the testing requirement collection k;
Step 3: test case prioritization;
Specifically comprise following step:
(1) establishing the test case that step 2 obtains is original test use cases T, and the test use cases after the ordering is ordering back test use cases T ';
(2) be original test use cases T structure equivalence class set Q={q
1, q
2..., q
n, q wherein
i={ t
I1, t
I2..., t
Im, i=1,2 ..., n, m=1,2 ..., n, q
iBe i equivalence class, t
ImBe m the test case that i equivalence class comprises, n is the equivalence class number, and m is the test case number that i equivalence class comprises; Each test case t
IjThe number req[j of the demand that it covered], j=1,2 ..., m; The equivalence class set is divided according to the type of test case;
(3) be each equivalence class q
iConstruct a priority number P
i, a disfigurement discovery sign Bug[i] and a defect rank Lev[i]; According to equivalence class q
iThe type of middle test case is with priority number P
iBe decided to be P
i=1, i.e. system class test case, perhaps P
i=2, i.e. function class test case, perhaps P
i=3, i.e. interface class test case, perhaps P
i=4, i.e. data class test case; Disfigurement discovery sign Bug[i] type be Boolean type, Bug[i]=i equivalence class q of 1 expression
iFound software defect, Bug[i]=i equivalence class q of 0 expression
iDo not find software defect; Defect rank Lev[i] represent that dissimilar defectives has different grades;
(4) equivalence class is gathered Q and carried out the initial priority ordering, according to the priority division principle in (3), parity price class q
iCarry out prioritization; Priority order from high to low be the data class test case-＞the interface class test case-＞the function class test case-＞the system class test case;
(5) from any equivalence class q
iIn choose a test case t
IjTested software is tested, and as finding software defect in the test process, then disfigurement discovery identifies Bug[i]=1; Otherwise then disfigurement discovery identifies Bug[i]=0;
(6) judge Bug[i] value whether be 1, as be 1 and change priority number P
i, be specially P
i=Lev[i]+initial priority counts P
iOtherwise,, with priority number P
iRemain unchanged;
(7) according to the final priority number of each equivalence class that obtains in (6), sort, form the equivalence class sequence according to priority number parity price class;
(8) use greedy algorithm to find out equivalence class q
iMinimum test use cases T
i, then
(9) T that in (8), obtains
iIn each test case t
IjThe demand number req[j that is covered] size test case is sorted, cover the many test cases of demand number and come the front, the result after will sorting then is inserted in the equivalence class sequence;
(10) the back test use cases T ' that obtains sorting;
Obtain sorting behind the test use cases T ' of back, software is carried out software test.
The invention has the advantages that:
The invention discloses one from the testing requirement yojan-＞test case generates-＞that cycle tests generates is complete, test case is chosen process efficiently, reaches under the prerequisite of expected test coverage rate guaranteeing, the test case quantity of generation reduces greatly; Simultaneously test case is carried out prioritization, the test of this extensive software of web application is had practical significance, improved testing efficiency.
Description of drawings
Fig. 1 is a method flow diagram of the present invention;
Fig. 2 is the intensive simple process flow diagram of step 1 testing requirement of the present invention.
Fig. 3 is a test case prioritization process flow diagram of the present invention.
Embodiment
The present invention is described in further detail below in conjunction with drawings and Examples.
The present invention is a kind of test case choosing method, based on the testing requirement yojan with improve greedy algorithm, described one from the testing requirement yojan-＞the test case design-＞that cycle tests generates is complete, test case is chosen process efficiently.In test case demand stage, at first carry out yojan, generate test case then, reduce the test case redundancy; In the test case operational phase, the notion that " equivalence class " divided is incorporated in the greedy algorithm, and right test case is carried out prioritization, has improved testing efficiency.
A kind of test case choosing method, flow process comprises following steps as shown in Figure 1:
Step 1:, obtain yojan testing requirement collection by original testing requirement collection;
To the original testing requirement collection of input, adopt testing requirement Algorithm for Reduction based on linear search, be applicable to the testing requirement yojan of large-scale application software, flow process specifically comprises following step as shown in Figure 2:
(1) the original testing requirement collection of initialization R is R={r
1, r
2... r
m, r wherein
iBe testing requirement, i=1,2 ... m initialization yojan testing requirement collection R ' is
Initialization test demand k is
(2) whether the original testing requirement collection of cycle criterion R is empty, as then carrying out (8) for sky, otherwise then execution (3);
(3) take out any testing requirement r from original testing requirement collection R, make testing requirement k=r, this moment, original testing requirement collection was updated to R:=R-{r};
(4) the testing requirement r among the original testing requirement collection R of selection
i, 1 i of this step every execution of operation adds up 1 time, judges r simultaneously
iWhether be last testing requirement, if then carry out (7), if otherwise carry out (5);
(5) calculate testing requirement r
iWhether with the common factor of testing requirement k, judge occuring simultaneously simultaneously is empty, if for sky then carry out (4), if for sky then carry out (6);
(6) refresh test demand k makes k:=k ⌒ r
i, upgrade original testing requirement collection R, make R:=R-{r
i; Carry out (4)
(7) calculate yojan testing requirement collection R ', make R ' :=R '+{ k}; Carry out (2);
(8) obtain final yojan testing requirement collection R '.
Step 2: test case design;
According to the yojan testing requirement collection R ' after the yojan that obtains in the step 1,, adopt boundary value analysis method design test case according to the constraint condition between each testing requirement among the testing requirement collection k.
By long-term test job experience, can access a large amount of mistakes is to occur on the border of the scope of inputing or outputing, rather than occurs in the inside of input, therefore at various border condition design test case, can find more mistake.Use boundary value analysis method design test case, at first should determine border condition, usually the border of input and output is exactly the border condition that should test emphatically, should choose just in time equal, just greater than or just less than the value on border as test data, rather than the representative value of choosing or arbitrary value are as test data.
Based on boundary value analysis method design test case, analyze the specification of tested software, find out its possible boundary condition, concrete several situations are:
(1), then should get the value on the border that has just reached this scope, and the value that has just surmounted this range boundary is as test input data if initial conditions has been stipulated the scope of value;
(2) if initial conditions has been stipulated the number of value, then with maximum number, minimum number, lack one, Duo one number as test data than maximum number than minimum number;
(3) according to each initial conditions of the specification of tested software, adopt step (1);
(4) according to each initial conditions of the specification of tested software, adopt step (2);
(5) if orderly when input domain that the specification of tested software provides or domain output, then should choose first element of Ji Tai and last element as test case;
(6) if used an internal data structure in the tested software, the borderline value that then should select this internal data structure is as test case;
For example, require to be the 1-99 month serviceable life of some products, just can get 0,1,99,100 data during the design use-case as test case.
Step 3: test case prioritization;
The method that adopts " equivalence class " test to combine with greedy algorithm is carried out the test case priority ordering.
So-called " equivalence class " is divided into some parts to the probable value of input data exactly, each partial data all with this part in all data identical character is arranged.Based on this principle: can determine to think reasonably that so other use-cases also can not find defective in this equivalence class if from the test case of " equivalence class ", do not find defective.Vice versa.Here according to this principle, test case is divided into several equivalence classes, carry out the assignment of priority then, use greedy algorithm preferentially to choose those test case that contains limit priority " equivalence class " set, then in the iteration tests process, find the situation of the test case " equivalence class " of software defect to change priority according to test process, search can be found test case " equivalence class " collection that defective is many.
Greedy algorithm is a kind of optimum solution of not pursuing, and only wishes to obtain the comparatively method of satisfactory solution.Since it saved for look for optimum solution want limit the plenty of time that might must expend, what generally can obtain fast being satisfied with separates.Greedy algorithm is always preferentially chosen the test case of cover-most test coverage criterion in choosing the process of test case, when all test coverage criterions all were covered to, algorithm stopped.
The essence of test case prioritization be with former be that test use cases is divided into a plurality of equivalence classes, at first the parity price class sorts, use greedy algorithm to find out the minimum test set of each equivalence class then, to the ordering of the test case in each minimum test set, the test case that all are sorted is by the unified ordering of the order of equivalence class under it then.Test case prioritization flow process specifically comprises following step as shown in Figure 3:
(1) establishing the test case that step 2 obtains is original test use cases T, and the test use cases after the ordering is ordering back test use cases T ';
(2) be original test use cases T structure equivalence class set Q={q
1, q
2..., q
n, q wherein
i={ t
I1, t
I2..., t
Im, i=1,2 ..., n, m=1,2 ..., n, q
iBe i equivalence class, t
ImBe m the test case that i equivalence class comprises, n is the equivalence class number, and m is the test case number that i equivalence class comprises; Each test case t
IjThe number req[j of the demand that it covered], j=1,2 ..., m; The equivalence class set can be divided according to the type of test case.
(3) be each equivalence class q
iConstruct a priority number P
i, a disfigurement discovery sign Bug[i] and a defect rank Lev[i].According to equivalence class q
iThe type of middle test case is with priority number P
iBe decided to be P
i=1 (system class test case) or P
i=2 (function class test case) or P
i=3 (interface class test case) or P
i=4 (data class test cases); Disfigurement discovery sign Bug[i] type be Boolean type, Bug[i]=i equivalence class q of 1 expression
iFound software defect, Bug[i]=i equivalence class q of 0 expression
iDo not find software defect.Defect rank Lev[i] represent that dissimilar defectives has different grades, Lev[i] value big more description defect serious more, as common defective be memory overflow (defect rank is 5), divisor may be for zero (defect rank is 5), Array Bound (defect rank is 4), floating number more improper (defect rank is 3), use null pointer (defect rank is 2), exist unreachable statement (defect rank is 1) etc., the hierarchal order of these defectives be major defect-＞general defective-＞light defects.
(4) equivalence class is gathered Q and carried out the initial priority ordering, according to the priority division principle in (3), parity price class q
iCarry out prioritization.Priority order from high to low be the data class test case-＞the interface class test case-＞the function class test case-＞the system class test case;
(5) from any equivalence class q
iIn choose a test case t
IjTested software is tested, and as finding software defect in the test process, then disfigurement discovery identifies Bug[i]=1; Otherwise then disfigurement discovery identifies Bug[i]=0.
(6) judge Bug[i] value whether be 1, as be 1 and change priority number P
i, be specially P
i=Lev[i]+initial priority counts P
i(for example, former priority P
iBe 2, defect rank Lev[i] be 4, then new priority P
iBe 6), otherwise, with priority number P
iRemain unchanged.
(7) according to the final priority number of each equivalence class that obtains in (6), sort, form the equivalence class sequence according to priority number parity price class.
(8) use greedy algorithm to find out equivalence class q
iMinimum test use cases T
i, then
(9) T that in (8), obtains
iIn each test case t
IjThe demand number req[j that is covered] size test case is sorted, cover the many test cases of demand number and come the front, the result after will sorting then is inserted in the equivalence class sequence.
(10) the back test use cases T ' that obtains sorting.
Obtain sorting behind the test use cases T ' of back, just can carry out software test software.
Claims (2)
1. a test case choosing method is characterized in that, comprises following step:
Step 1:, obtain yojan testing requirement collection by original testing requirement collection;
Specifically comprise following step:
1) the original testing requirement collection of initialization R is R={r
1, r
2... r
m, r wherein
iBe testing requirement, i=1,2 ... m, initialization yojan testing requirement collection R ' is
Initialization test demand k is
2) whether the original testing requirement collection of cycle criterion R is empty, as then carrying out 8 for sky), otherwise carry out 3);
3) take out any testing requirement r from original testing requirement collection R, make testing requirement k=r, this moment, original testing requirement collection was updated to R:=R-{r};
4) the testing requirement r among the original testing requirement collection R of selection
i, 1 i of this step every execution of operation adds up 1 time, judges r simultaneously
iWhether be last testing requirement, if then carry out 7), if otherwise carry out 5);
5) calculate testing requirement r
iWhether with the common factor of testing requirement k, judge occuring simultaneously simultaneously is empty, if for sky would carry out 4), if for sky would carry out 6);
6) refresh test demand k makes k:=k ⌒ r
i, upgrade original testing requirement collection R, make R:=R-{r
i; Carry out 4)
7) calculate yojan testing requirement collection R ', make R ' :=R '+{ k}; Carry out 2);
8) obtain final yojan testing requirement collection R ';
Step 2: test case design;
According to the yojan testing requirement collection R ' after the yojan that obtains in the step 1,, adopt boundary value analysis method design test case according to the constraint condition between each testing requirement among the testing requirement collection k;
Step 3: test case prioritization;
Specifically comprise following step:
(1) establishing the test case that step 2 obtains is original test use cases T, and the test use cases after the ordering is ordering back test use cases T ';
(2) be original test use cases T structure equivalence class set Q={q
1, q
2..., q
n, q wherein
i={ t
I1, t
I2..., t
Im, i=1,2 ..., n, m=1,2 ..., n, q
iBe i equivalence class, t
ImBe m the test case that i equivalence class comprises, n is the equivalence class number, and m is the test case number that i equivalence class comprises; Each test case t
IjThe number req[j of the demand that it covered], j=1,2 ..., m; The equivalence class set is divided according to the type of test case;
(3) be each equivalence class q
iConstruct a priority number P
i, a disfigurement discovery sign Bug[i] and a defect rank Lev[i]; According to equivalence class q
iThe type of middle test case is with priority number P
iBe decided to be P
i=1, i.e. system class test case, perhaps P
i=2, i.e. function class test case, perhaps P
i=3, i.e. interface class test case, perhaps P
i=4, i.e. data class test case; Disfigurement discovery sign Bug[i] type be Boolean type, Bug[i]=i equivalence class q of 1 expression
iFound software defect, Bug[i]=i equivalence class q of 0 expression
iDo not find software defect; Defect rank Lev[i] represent that dissimilar defectives has different grades;
(4) equivalence class is gathered Q and carried out the initial priority ordering, according to the priority division principle in (3), parity price class q
iCarry out prioritization; Priority order from high to low be the data class test case-＞the interface class test case-＞the function class test case-＞the system class test case;
(5) from any equivalence class q
iIn choose a test case t
IjTested software is tested, and as finding software defect in the test process, then disfigurement discovery identifies Bug[i]=1; Otherwise then disfigurement discovery identifies Bug[i]=0;
(6) judge Bug[i] value whether be 1, as be 1 and change priority number P
i, be specially P
i=Lev[i]+initial priority counts P
iOtherwise,, with priority number P
iRemain unchanged;
(7) according to the final priority number of each equivalence class that obtains in (6), sort, form the equivalence class sequence according to priority number parity price class;
(8) use greedy algorithm to find out equivalence class q
iMinimum test use cases T
i, then
(9) T that in (8), obtains
iIn each test case t
IjThe demand number req[j that is covered] size test case is sorted, cover the many test cases of demand number and come the front, the result after will sorting then is inserted in the equivalence class sequence;
(10) the back test use cases T ' that obtains sorting;
Obtain sorting behind the test use cases T ' of back, software is carried out software test.
2. a kind of test case choosing method according to claim 1 is characterized in that, in the described step 2 based on boundary value analysis method design test case is, analyzes the specification of tested software, finds out its boundary condition, and concrete several situations are:
(1), then should get the value on the border that has just reached this scope, and the value that has just surmounted this range boundary is as test input data if initial conditions has been stipulated the scope of value;
(2) if initial conditions has been stipulated the number of value, then with maximum number, minimum number, lack one, Duo one number as test data than maximum number than minimum number;
(3) according to each initial conditions of the specification of tested software, adopt step (1);
(4) according to each initial conditions of the specification of tested software, adopt step (2);
(5) if orderly when input domain that the specification of tested software provides or domain output, then should choose first element of Ji Tai and last element as test case;
(6) if used an internal data structure in the tested software, the borderline value that then should select this internal data structure is as test case.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110039023 CN102063376B (en) | 2011-02-16 | 2011-02-16 | Test case selection method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110039023 CN102063376B (en) | 2011-02-16 | 2011-02-16 | Test case selection method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102063376A true CN102063376A (en) | 2011-05-18 |
| CN102063376B CN102063376B (en) | 2013-01-16 |
Family
ID=43998661
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110039023 Expired - Fee Related CN102063376B (en) | 2011-02-16 | 2011-02-16 | Test case selection method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102063376B (en) |
Cited By (32)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102364449A (en) * | 2011-10-24 | 2012-02-29 | 中兴通讯股份有限公司 | Generation method and system for minimum test case set |
| CN102495804A (en) * | 2011-12-27 | 2012-06-13 | 创新科存储技术（深圳）有限公司 | Automatic software testing method |
| CN102662833A (en) * | 2012-03-21 | 2012-09-12 | 天津书生软件技术有限公司 | Method for managing test cases |
| CN102880545A (en) * | 2012-08-30 | 2013-01-16 | 中国人民解放军63928部队 | Method for dynamically adjusting priority sequence of test cases |
| CN103019669A (en) * | 2011-09-21 | 2013-04-03 | 通用汽车环球科技运作有限责任公司 | Software test case generation from a partial design model |
| CN103064780A (en) * | 2011-10-18 | 2013-04-24 | 阿里巴巴集团控股有限公司 | Software testing method and device thereof |
| CN103500142A (en) * | 2013-10-12 | 2014-01-08 | 南京大学 | Method for testing multiple target test case priorities facing dynamic Web application |
| CN103810104A (en) * | 2014-03-04 | 2014-05-21 | 中国人民解放军63863部队 | Method and system for optimizing software test case |
| CN103838667A (en) * | 2012-11-27 | 2014-06-04 | 腾讯科技（深圳）有限公司 | Ordering method and device for using modes of application program |
| CN104932975A (en) * | 2015-05-28 | 2015-09-23 | 浪潮(北京)电子信息产业有限公司 | Test case selection method and device |
| CN105391599A (en) * | 2015-11-17 | 2016-03-09 | 广西大学 | Train communication network conformance test method and device |
| CN105426312A (en) * | 2015-12-31 | 2016-03-23 | 北京经纬恒润科技有限公司 | Test suite generation method and device for smoke tests |
| CN105512046A (en) * | 2016-02-01 | 2016-04-20 | 北京理工大学 | Particle swarm optimization (PSO) algorithm based Android automatic testing method |
| WO2016188170A1 (en) * | 2015-10-22 | 2016-12-01 | 中兴通讯股份有限公司 | Test method and device, apparatus and computer storage medium |
| CN107102942A (en) * | 2017-04-01 | 2017-08-29 | 南京邮电大学 | A kind of minimum Fault Locating Method based on input domain location of mistake |
| CN107291620A (en) * | 2017-06-30 | 2017-10-24 | 郑州云海信息技术有限公司 | A kind of method for generating test case and device |
| CN107463505A (en) * | 2017-09-29 | 2017-12-12 | 郑州云海信息技术有限公司 | A kind of method and device that minimum set of uses case is generated based on testing requirement |
| CN104461875B (en) * | 2014-11-23 | 2018-01-09 | 国云科技股份有限公司 | A kind of method according to equivalence class design software test case |
| CN104090837B (en) * | 2014-06-19 | 2018-02-09 | 苏州市职业大学 | The method for generating test case |
| CN107728600A (en) * | 2017-09-06 | 2018-02-23 | 中国航空工业集团公司西安飞行自动控制研究所 | A kind of BIT test command systems of selection based on priority |
| CN107741912A (en) * | 2017-11-22 | 2018-02-27 | 郑州云海信息技术有限公司 | A kind of method, apparatus simplified to test case, equipment and storage medium |
| US10025696B2 (en) | 2016-02-09 | 2018-07-17 | General Electric Company | System and method for equivalence class analysis-based automated requirements-based test case generation |
| CN108694123A (en) * | 2018-05-14 | 2018-10-23 | 中国平安人寿保险股份有限公司 | A kind of regression testing method, computer readable storage medium and terminal device |
| CN109491898A (en) * | 2018-10-30 | 2019-03-19 | 武汉思普崚技术有限公司 | Testing efficiency method for improving and equipment based on automatic test and case management |
| CN109710514A (en) * | 2018-12-10 | 2019-05-03 | 江苏大学 | The solution and system of tie-breaking in priorities of test cases sequence |
| CN109947656A (en) * | 2019-03-29 | 2019-06-28 | 北京奇艺世纪科技有限公司 | A kind of testing case management and device |
| CN110321291A (en) * | 2019-07-12 | 2019-10-11 | 中国工商银行股份有限公司 | Test cases intelligent extraction system and method |
| CN111209194A (en) * | 2019-12-30 | 2020-05-29 | 杭州安恒信息技术股份有限公司 | Test case design method for discovering memory leakage bug |
| CN111813694A (en) * | 2020-08-11 | 2020-10-23 | 中国工商银行股份有限公司 | Test method, test device, electronic device, and readable storage medium |
| CN112485483A (en) * | 2020-10-29 | 2021-03-12 | 国网湖北省电力有限公司电力科学研究院 | Relay protection test state sequence generation method and platform |
| CN114168472A (en) * | 2021-12-09 | 2022-03-11 | 惠州Tcl移动通信有限公司 | Use case execution method and device, electronic equipment and computer readable storage medium |
| CN114880242A (en) * | 2022-06-08 | 2022-08-09 | 北京百度网讯科技有限公司 | Test case extraction method, device, equipment and medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7315973B1 (en) * | 2005-09-30 | 2008-01-01 | Unisys Corporation | Method and apparatus for choosing tests for simulation and associated algorithms and hierarchical bipartite graph data structure |
| CN101464831A (en) * | 2009-01-09 | 2009-06-24 | 西安邮电学院 | Reduction technology for test use cases |
| CN101593145A (en) * | 2008-05-29 | 2009-12-02 | 福建升腾资讯有限公司 | Designing method of high-efficiency high-coverage-rate function test case |
-
2011
- 2011-02-16 CN CN 201110039023 patent/CN102063376B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7315973B1 (en) * | 2005-09-30 | 2008-01-01 | Unisys Corporation | Method and apparatus for choosing tests for simulation and associated algorithms and hierarchical bipartite graph data structure |
| CN101593145A (en) * | 2008-05-29 | 2009-12-02 | 福建升腾资讯有限公司 | Designing method of high-efficiency high-coverage-rate function test case |
| CN101464831A (en) * | 2009-01-09 | 2009-06-24 | 西安邮电学院 | Reduction technology for test use cases |
Non-Patent Citations (2)
| Title |
|---|
| 《计算机学报》 20031212 聂长海等 "一种最小测试用例集生成方法" 第26卷, 第12期 * |
| 聂长海等: ""一种最小测试用例集生成方法"", 《计算机学报》 * |
Cited By (46)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103019669B (en) * | 2011-09-21 | 2016-01-20 | 通用汽车环球科技运作有限责任公司 | The method and system that a kind of software test case from localized design model generates |
| CN103019669A (en) * | 2011-09-21 | 2013-04-03 | 通用汽车环球科技运作有限责任公司 | Software test case generation from a partial design model |
| CN103064780A (en) * | 2011-10-18 | 2013-04-24 | 阿里巴巴集团控股有限公司 | Software testing method and device thereof |
| CN103064780B (en) * | 2011-10-18 | 2016-06-01 | 阿里巴巴集团控股有限公司 | A kind of method of software test and device |
| CN102364449A (en) * | 2011-10-24 | 2012-02-29 | 中兴通讯股份有限公司 | Generation method and system for minimum test case set |
| CN102364449B (en) * | 2011-10-24 | 2017-04-12 | 中兴通讯股份有限公司 | Generation method and system for minimum test case set |
| CN102495804A (en) * | 2011-12-27 | 2012-06-13 | 创新科存储技术（深圳）有限公司 | Automatic software testing method |
| CN102662833A (en) * | 2012-03-21 | 2012-09-12 | 天津书生软件技术有限公司 | Method for managing test cases |
| CN102662833B (en) * | 2012-03-21 | 2014-12-03 | 天津书生软件技术有限公司 | Method for managing test cases |
| CN102880545A (en) * | 2012-08-30 | 2013-01-16 | 中国人民解放军63928部队 | Method for dynamically adjusting priority sequence of test cases |
| CN103838667A (en) * | 2012-11-27 | 2014-06-04 | 腾讯科技（深圳）有限公司 | Ordering method and device for using modes of application program |
| CN103500142B (en) * | 2013-10-12 | 2016-05-04 | 南京大学 | Towards the multiple target priorities of test cases method of testing of Dynamic Web Applications |
| CN103500142A (en) * | 2013-10-12 | 2014-01-08 | 南京大学 | Method for testing multiple target test case priorities facing dynamic Web application |
| CN103810104A (en) * | 2014-03-04 | 2014-05-21 | 中国人民解放军63863部队 | Method and system for optimizing software test case |
| CN103810104B (en) * | 2014-03-04 | 2017-08-25 | 中国人民解放军63863部队 | A kind of software test case optimization method and system |
| CN104090837B (en) * | 2014-06-19 | 2018-02-09 | 苏州市职业大学 | The method for generating test case |
| CN104461875B (en) * | 2014-11-23 | 2018-01-09 | 国云科技股份有限公司 | A kind of method according to equivalence class design software test case |
| CN104932975B (en) * | 2015-05-28 | 2018-01-09 | 浪潮(北京)电子信息产业有限公司 | A kind of test cases selection method and apparatus |
| CN104932975A (en) * | 2015-05-28 | 2015-09-23 | 浪潮(北京)电子信息产业有限公司 | Test case selection method and device |
| WO2016188170A1 (en) * | 2015-10-22 | 2016-12-01 | 中兴通讯股份有限公司 | Test method and device, apparatus and computer storage medium |
| CN105391599A (en) * | 2015-11-17 | 2016-03-09 | 广西大学 | Train communication network conformance test method and device |
| CN105426312A (en) * | 2015-12-31 | 2016-03-23 | 北京经纬恒润科技有限公司 | Test suite generation method and device for smoke tests |
| CN105512046A (en) * | 2016-02-01 | 2016-04-20 | 北京理工大学 | Particle swarm optimization (PSO) algorithm based Android automatic testing method |
| US10437713B2 (en) | 2016-02-09 | 2019-10-08 | General Electric Company | System and method for equivalence class analysis-based automated requirements-based test case generation |
| US10025696B2 (en) | 2016-02-09 | 2018-07-17 | General Electric Company | System and method for equivalence class analysis-based automated requirements-based test case generation |
| CN107102942A (en) * | 2017-04-01 | 2017-08-29 | 南京邮电大学 | A kind of minimum Fault Locating Method based on input domain location of mistake |
| CN107102942B (en) * | 2017-04-01 | 2020-09-25 | 南京邮电大学 | Input domain error positioning-based minimum fault positioning method |
| CN107291620A (en) * | 2017-06-30 | 2017-10-24 | 郑州云海信息技术有限公司 | A kind of method for generating test case and device |
| CN107728600A (en) * | 2017-09-06 | 2018-02-23 | 中国航空工业集团公司西安飞行自动控制研究所 | A kind of BIT test command systems of selection based on priority |
| CN107463505A (en) * | 2017-09-29 | 2017-12-12 | 郑州云海信息技术有限公司 | A kind of method and device that minimum set of uses case is generated based on testing requirement |
| CN107741912A (en) * | 2017-11-22 | 2018-02-27 | 郑州云海信息技术有限公司 | A kind of method, apparatus simplified to test case, equipment and storage medium |
| CN108694123A (en) * | 2018-05-14 | 2018-10-23 | 中国平安人寿保险股份有限公司 | A kind of regression testing method, computer readable storage medium and terminal device |
| CN108694123B (en) * | 2018-05-14 | 2023-07-21 | 中国平安人寿保险股份有限公司 | Regression testing method, computer readable storage medium and terminal equipment |
| CN109491898B (en) * | 2018-10-30 | 2021-11-12 | 武汉思普崚技术有限公司 | Test efficiency improving method and equipment based on automatic test and case management |
| CN109491898A (en) * | 2018-10-30 | 2019-03-19 | 武汉思普崚技术有限公司 | Testing efficiency method for improving and equipment based on automatic test and case management |
| CN109710514A (en) * | 2018-12-10 | 2019-05-03 | 江苏大学 | The solution and system of tie-breaking in priorities of test cases sequence |
| CN109947656A (en) * | 2019-03-29 | 2019-06-28 | 北京奇艺世纪科技有限公司 | A kind of testing case management and device |
| CN110321291A (en) * | 2019-07-12 | 2019-10-11 | 中国工商银行股份有限公司 | Test cases intelligent extraction system and method |
| CN111209194A (en) * | 2019-12-30 | 2020-05-29 | 杭州安恒信息技术股份有限公司 | Test case design method for discovering memory leakage bug |
| CN111209194B (en) * | 2019-12-30 | 2023-12-19 | 杭州安恒信息技术股份有限公司 | Test case design method for finding memory leakage bug |
| CN111813694A (en) * | 2020-08-11 | 2020-10-23 | 中国工商银行股份有限公司 | Test method, test device, electronic device, and readable storage medium |
| CN111813694B (en) * | 2020-08-11 | 2024-03-15 | 中国工商银行股份有限公司 | Test method, test device, electronic equipment and readable storage medium |
| CN112485483A (en) * | 2020-10-29 | 2021-03-12 | 国网湖北省电力有限公司电力科学研究院 | Relay protection test state sequence generation method and platform |
| CN114168472A (en) * | 2021-12-09 | 2022-03-11 | 惠州Tcl移动通信有限公司 | Use case execution method and device, electronic equipment and computer readable storage medium |
| CN114880242A (en) * | 2022-06-08 | 2022-08-09 | 北京百度网讯科技有限公司 | Test case extraction method, device, equipment and medium |
| CN114880242B (en) * | 2022-06-08 | 2023-01-13 | 北京百度网讯科技有限公司 | Test case extraction method, device, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102063376B (en) | 2013-01-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102063376B (en) | Test case selection method | |
| CA3099664C (en) | Cloud-edge topologies | |
| Marcu et al. | Spark versus flink: Understanding performance in big data analytics frameworks | |
| CN101443733B (en) | Method and system for executing graph-based computations | |
| Briant et al. | The optimal diversity management problem | |
| Quan et al. | Task scheduling for energy consumption constrained parallel applications on heterogeneous computing systems | |
| CN103116493B (en) | A kind of automatic mapping method being applied to coarse-grained reconfigurable array | |
| CN102799624B (en) | Large-scale graph data query method in distributed environment based on Datalog | |
| CN104050042A (en) | Resource allocation method and resource allocation device for ETL (Extraction-Transformation-Loading) jobs | |
| CN101017546A (en) | Method and device for categorical data batch processing | |
| Song et al. | Scheduling workflows with composite tasks: A nested particle swarm optimization approach | |
| CN104778079A (en) | Method and device used for dispatching and execution and distributed system | |
| CN109522428A (en) | A kind of external memory access method of the figure computing system based on index positioning | |
| CN103902016A (en) | Server power consumption management method oriented to scene prediction | |
| Deng et al. | A data and task co-scheduling algorithm for scientific cloud workflows | |
| CN113467944B (en) | Resource deployment device and method for complex software system | |
| CN105867998A (en) | Virtual machine cluster deployment algorithm | |
| CN113807046A (en) | Test excitation optimization regression verification method, system and medium | |
| CN101408850B (en) | Method of in task flow computation model | |
| CN103699653A (en) | Method and device for clustering data | |
| Mao et al. | An optimal distributed K-Means clustering algorithm based on cloudstack | |
| Quan et al. | An iterative multi-application mapping algorithm for heterogeneous mpsocs | |
| CN112748997A (en) | Workflow scheduling method and system | |
| CN106155799A (en) | Codelet dispatching method based on genetic algorithm | |
| CN114003389A (en) | Cloud platform resource allocation method and system based on joint selection and virtual machine placement |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130116 Termination date: 20220216 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |