CN105808438A - Test case reuse method based on function call path - Google Patents
Test case reuse method based on function call path Download PDFInfo
- Publication number
- CN105808438A CN105808438A CN201610140764.XA CN201610140764A CN105808438A CN 105808438 A CN105808438 A CN 105808438A CN 201610140764 A CN201610140764 A CN 201610140764A CN 105808438 A CN105808438 A CN 105808438A
- Authority
- CN
- China
- Prior art keywords
- function
- alternative routing
- path
- test
- change
- 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
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/368—Test management for test version control, e.g. updating test cases to a new software version
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention discloses a test case reuse method based on a function call path. The method comprises following steps of step 1, determining a change path set needing to be tested in new version software by using a to-be-tested change path determining method, wherein the to-be-tested change path determining method comprises following steps of collecting change function information, selecting change paths from a change path set and finally determining the change path set needing to be tested; and step 2, generating a reuse test case. According to the embodiment of the invention, the test case can be reused, thus reducing the test work load and improving the test efficiency.
Description
Technical field
The present invention relates to technical field of measurement and test, particularly relate to a kind of Reuse of Test Cases method based on function call path.
Background technology
When software version is upgraded, it is bound to after having write code and carries out various test, and the workload of test is generally very big.When testing, it usually needs write test case, using test case as the input of software, software is tested.Stability and reliability for software, it usually needs write substantial amounts of test case when test, so causes that software test typically requires the substantial amounts of manpower and materials of consuming.
Summary of the invention
For needing the problem of writing a large amount of test case so that software to be tested in prior art, the embodiment of the present invention proposes a kind of Reuse of Test Cases method based on function call path, it is possible to test case carries out multiplexing, improves work efficiency and also reduces workload.
In order to achieve the above object, the embodiment of the present invention proposes a kind of Reuse of Test Cases method based on function call path, including:
Step 1, utilize alternative routing defining method to be measured determine new version software needs test alternative routing collection, described alternative routing defining method to be measured includes: gathers and changes function information, and concentrate selection alternative routing from alternative routing, so that it is determined that the final alternative routing collection needing test;;
Step 2, generate multiplexing test case.
Wherein, described step 1 specifically includes:
Partial code is changed in step 11, analysis, it is determined that with the function that change function exists dependence;
Step 12, according to change function dependence function, it is determined that change function correlation function;
Step 13, the correlation function pair consisted of change function and correlation function, select alternative routing from all alternative routings of new version software program, it is determined that the final alternative routing collection needing to test.
Wherein, step 2 specifically includes:
Step 21, calling path Algorithms of Selecting according to similarity of paths computational methods and similar function, calculate alternative routing to be measured and original function and call the similarity in path, the original function choosing similarity high calls path;
Step 22, according to the result of calculation of similarity, alternative routing is classified, i.e. the alternative routing of structure change and the unchanged alternative routing of structure;
Step 23, analyze the change function of alternative routing, and according to changing the correlation function of function, amendment can not cover the test case of corresponding alternative routing to be measured, so that it is determined that final reusable test use cases.
Wherein, described step 2 also includes:
Step 24, test case is modified.
Test case can be carried out multiplexing to reduce the workload of test, to improve testing efficiency by the embodiment of the present invention.
Accompanying drawing explanation
Fig. 1Flow process for alternative routing defining method to be measured in the embodiment of the present invention is illustratedFigure;
Fig. 2Flow process for generating reusable test case in the embodiment of the present invention is illustratedFigure;
Fig. 3Corresponding relation for alternative routing to be measured in the embodiment of the present invention Yu test case;
Fig. 4 aFor original version program function call relationFigure,Fig. 4 bAmended change program function call relation for new version softwareFigure;
Fig. 5For the signal that the structure of alternative routing changesFigure;
Fig. 6For exemplary C programmer before changing with change after its corresponding function calling relationship of source codeFigure。
Detailed description of the invention
For making the technical problem to be solved in the present invention, technical scheme and advantage clearly, below in conjunction withAccompanying drawingAnd specific embodiment is described in detail.
First the several concepts in the embodiment of the present invention are illustrated.
1, changing the correlation function of function: the function referring to changing function fc and have incidence relation, namely there is the function of dependence with the partial code that changes changed in function fc, meanwhile, the correlation function changing function is that the mode by manual analysis is determined.Integrity and correctness in order to ensure the program of change, can after certain function be modified, analyze the program code changing part, determine there is the function of dependence with change part, namely the correlation function of part place function is changed, in order to tester verifies whether correlation function is subject to the impact of programing change.In a program, dependence is divided into data dependence relation and controls dependence, and data dependence relation, caused by same data, controls dependence and decides the execution sequence of function.
2, function calling relationship: reflect the relation between two functions in software program, suffers from being widely applied in program comprehension with analysis, software test and maintenance, compiling optimization, data-flow analysis and other field of software engineering many.In the thought in function call path, a function call path path={f0, f1, f2……fnIn adjacent two function f1And f2Between relation have two kinds: function calling relationship and order perform relation.If at function f1Program code in have invoked function f2,
It would be possible that there is following four situation:
(1) function f2The value of formal parameter have at least one to be by function f1In variable transferring;
(2) function f2Execution function f1In variable or with through function f1The variable processed is relevant;
(3) function f2Execution function f1Control condition relevant, control condition is probably in the statements such as if-else, while, for, switch-case the condition of any one statement;
(4) the two or three of three cases above.
As any in four kinds of possible situations more than occurring, then function f1And f2There is dependence.When the first or the second situation occur, function f1And f2There is data dependence relation;When the third situation occurs, function f1And f2Exist and control dependence;But when the 4th kind of situation occurs, function f1And f2There may exist data dependence relation, it is possible to there is control dependence, it is also possible to not only there is data dependence relation but also there is control dependence.
Except function calling relationship can make two functions produce dependence, the global variable in program can make two functions being absent from function calling relationship produce data dependence relation.Known function fcWith function fdIt is absent from function calling relationship, but function fcWith function fdIt is required for upon execution using global variable g, and variable g is through function fcAfter process, by function fdUse, then function fcFunction fdThere is data dependence relation.
Correlation function is to referring to function fcIt is associated with function frThe number formed is the function set of 2, and form is (fc, fr).Function fr1、fr2It is function fcCorrelation function, then (fc, fr1)、(fc, fr2) it is correlation function pair.
In embodiments of the present invention, original version software refers to existing software, and new version software refers to and carries out upgrading on original version basis of software, revises or other operate the software obtained.Owing to original version software has been carried out various amendment by new version software, it is therefore necessary to test new version software to determine whether new version software can be properly functioning.
A kind of Reuse of Test Cases method based on function call path that the embodiment of the present invention proposes, including:
Step 1, alternative routing defining method to be measured is utilized to determine the alternative routing collection of original version software and new version software, described include according to alternative routing defining method to be measured: gather and change functional dependence information, and concentrate selection alternative routing from alternative routing, so that it is determined that the final alternative routing collection needing test;
Such as Fig. 1Shown, specifically include:
Partial code is changed in step 11, analysis, it is determined that with the function that change function exists dependence;
Step 12, according to change function dependence function, it is determined that change function correlation function;
Step 13, the correlation function pair consisted of change function and correlation function, select alternative routing, it is determined that final alternative routing collection from all alternative routings of new version software program.
In embodiments of the present invention, the basic ideas of alternative routing defining method to be measured are: first, analyze and change partial code, it is determined that with the function that change function exists dependence;Then, according to the dependence function changing function, it is determined that change the correlation function of function;Finally, by changing function and the correlation function pair of correlation function composition, from all alternative routings of new version software program, alternative routing is selected, it is determined that the final alternative routing collection needing test.
The system of selection of alternative routing to be measured be all alternative routings in redaction program it has been determined that basis on carry out.All alternative routings of redaction program refer to and comprise all function call paths changing function.In the part alternative routing of redaction program, except changing function, change part and the execution of other function in this kind of alternative routing can't be produced impact, this kind of alternative routing is made without regression test, therefore, need all alternative routings from redaction program choose comprising the alternative routing changing function and correlation function thereof, form the final alternative routing collection needing test.
Alternative routing system of selection to be measured will change function and correlation function composition correlation function pair thereof, then the correlation function pair according to composition, from all alternative routings of redaction program, the alternative routing comprising correlation function pair chooses formation alternative routing collection successively, and this alternative routing collection is exactly the final alternative routing collection needing test.Alternative routing system of selection to be measured can reduce regression tested scope, reduces the quantity of regression test case.
Step 2, generate multiplexing test case.
Such as Fig. 2Shown, in the embodiment of the present invention, the basic ideas of Reuse of Test Cases are:
Step 21, calling path Algorithms of Selecting according to similarity of paths computational methods and similar function, calculate alternative routing to be measured and original function and call the similarity in path, the original function choosing similarity high calls path;
Step 22, according to the result of calculation of similarity, alternative routing is classified, i.e. the alternative routing of structure change and the unchanged alternative routing of structure;
Step 23, analyze alternative routing change function, and according to change function correlation function, amendment
The test case of corresponding alternative routing to be measured can not be covered
, so that it is determined that final reusable test use cases.
Further, described step 2 also includes:
Step 24, test case is modified.
The basic ideas of the Reuse of Test Cases method in step 2Such as Fig. 2Shown in.
Wherein, in the thought of function call path, function call path and test case have a kind of corresponding relation, call path according to this corresponding relation and the similar function chosen, and concentrate from former test case and select test case.The corresponding relation of alternative routing to be measured and test caseSuch as Fig. 3Shown in.
Make respectively below for step 21-step 23 and illustrating:
Step 21, calling path Algorithms of Selecting according to similarity of paths computational methods and similar function, calculate alternative routing to be measured and original function and call the similarity in path, the original function choosing similarity high calls path.
This step determines that the premise of reusable former test case.Call path at original function to concentrate, it is possible to have a plurality of original function to call path and can be converted to alternative routing to be measured through the operation of interpolation function, deletion function.Therefore the embodiment of the present invention proposes a kind of similarity of paths method, path can be called from original function by the method and concentrate and choose the original function most like with alternative routing to be measured and call path.The embodiment of the present invention use similarity of paths represent that original function calls the size in path and alternative routing similarity degree to be measured.
Wherein, similarity of paths refers to that original function calls the similarity degree in path and alternative routing to be measured, is primarily referred to as in function call path the structure etc. in the number of function, path.
The method particularly as follows:
Step 21, alternative routing to be measured and original function are called path as one section of character string, each function name in path is made as a whole, and this entirety is a character in character string;
Step 22, use Levenshtein distance calculate original function and call the number of times that path integration is alternative routing to be measured needs operation;Wherein Levenshtein distance refers to and is converted to the minima of edit operation number of times required for another character string by a character string, and edit operation refers to replacement operation, adds operation and deletion action;
It is more big with similarity Dsimilar, the Dsimilar of alternative routing to be measured that step 23, use formula (2.1) calculate function call path, and it is more high with the similarity of alternative routing that representative function calls path:
Wherein, levenshitein (pathoriginal,pathchange) it is that original function calls path pathoriginalWith alternative routing pathchangeBetween Levenshtein distance,
|pathchange| it is alternative routing pathchangeIn function number;
If the alternative routing compared calls with original function, path is identical, then both similarities are 1, and similarity reaches maximum, and otherwise, similarity is less than 1;
Function call path path1={ main, f1,f2,f3,f4,f5,f7, path2={ main, f1,f2,f3,f6,f5,f8, alternative routing pathc={ main, f1,f2,f3,f5,f8, by path path1And path2Regard one section of character string as, by path1And path2In function (main, f1Deng) regard an entirety as, calculate path respectively according to formula (2.1)1、path2With the similarity of alternative routing, path1And pathcLevenshtein distance be 2, then path1With alternative routing pathcSimilarity be 0.71;path2And pathcLevenshtein distance be 1, then path1With alternative routing pathcSimilarity be 0.86.
In actual development project, software changes and is mostly because revising certain or some function internal codes, add function, to delete the operations such as function caused.Therefore the similarity of paths computing formula that the embodiment of the present invention is proposed is applicable to calculate under this software alteration, and alternative routing to be measured and original function call the similarity in path.
Step 22, according to the result of calculation of similarity, alternative routing is classified, i.e. the alternative routing of structure change and the unchanged alternative routing of structure.
It is have three kinds of amendment situations mostly owing to software changes: Modification growth function internal code, interpolation function, deletion function.According to the function alteration in software, changing function information by gathering, it is determined that alternative routing, alternative routing can be divided into two classes: the alternative routing of structure change, the unchanged alternative routing of structure.In the embodiment of the present invention, the alternative routing of the structure change of indication refers to that path is added or deletes function, it is impossible to calls path at original function and concentrates the alternative routing found;The unchanged alternative routing of structure refers to that the number of function in path and path structure are not produced impact by the amendment on function, and namely the structure in path does not change, and can call path at original function and concentrate the alternative routing found.For round-robin queue's program, it is assumed that with the addition of function PrintMg, and function DeQueue is modified.Such as Fig. 4 aWithFig. 4 bIllustrate for example:Fig. 4 aFor original version program function call relationFigure,Fig. 4 bAmended change program function call relation for new version softwareFigure。
According toFig. 4 aOriginal program function calling relationship is it can be seen that original program has 3 function call paths;And according toFig. 4 bChange program function call relation it can be seen that change program has 2 alternative routings.The function call path collection of original program can be summarized asSuch as table 2.1 shown in;And the alternative routing collection changing program can be summarized asTable 2.2 shown in.
Table 2.1 original function calls path collection
Numbering/i | Function call path/pathi |
1 | main,Initial,EnQueue,IsFull,end |
2 | main,Initial,EnQueue,IsFull,Front,IsEmpty,end |
3 | main,Initial,EnQueue,IsFull,Front,IsEmpty,DeQueue,IsEmpty,end |
Table 2.2 alternative routing collection
Numbering/i | Alternative routing/pathci |
1 | main,Initial,EnQueue,IsFull,printMg,end |
2 | main,Initial,EnQueue,IsFull,Front,IsEmpty,DeQueue,IsEmpty,end |
Owing to function DeQueue being modified, and with the addition of function PrintMg, therefore function DeQueue and function PrintMg changes function, then the function call path at they places is alternative routing, i.e. pathc1, pathc2.Alternative routing pathc1, pathc2 and original function call the function call path concentrated in path compare, path concentration can be called at original function and find the function call path identical with alternative routing pathc2, path3, then pathc2 is the unchanged alternative routing of structure;Do not call path concentration at original function and find the function call path identical with alternative routing pathc1, then pathc1 is the alternative routing of structure change.
The alternative routing of structure change is because, when update routine, adding, delete or have modified certain function, makes the node number in alternative routing there occurs change.The structure change of alternative routing has following several situation,Such as Fig. 5Shown in.
Step 23, analyze the change function of alternative routing, and according to changing the correlation function of function, amendment controls the test case corresponding to alternative routing of logic change, so that it is determined that final reusable test use cases.
After determining alternative routing, it is necessary to call the function call path concentrated in path with original function and mate, choose the function call path similar to alternative routing.In the matching process, it is necessary to calculate original function and call the similarity in path and alternative routing, by the result of calculation of similarity, alternative routing is classified.If path concentration can be called at original function to find the function call path identical with alternative routing, then similarity is 1, and this alternative routing is the unchanged alternative routing of structure.Concentrate and find same functions for path can not be called at original function and call the alternative routing in path, it is necessary to analyzeFig. 5In several situations of alternative routing structure change of listing, and by the result of Similarity Measure is compared, find the original function the highest with alternative routing similarity to call path.
?Fig. 5In, after alternative routing structure changes, there are four kinds of situations.How to search similar function for the alternative routing of structure change and call path, be one of similar function research emphasis calling path selecting method.WithFig. 5F is deleted in (2) of middle secondary series2Alternative routing be example, in the process choosing similar function and calling path, when traversing function f1Afterwards, original function calls the f in path1Next function f2With the f in alternative routing1Next function f3Differ, then need traversal function f2Next function, until find the function f with alternative routing3Identical function or till traversing last function that original function calls path.In the process choosing similar function and calling path, it is necessary to considerFig. 5In four kinds of situations, and for finding not only similar function to call the alternative routing in path, calculate similar function and call the similarity in path and alternative routing, choose the highest original function of similarity and call path and call path as the similar function of alternative routing.
Similar function call path Algorithms of Selecting need use linear linked list andFigureStorage organization adjacency list.Linear linked list is the Linked Storage Structure of linear list, and adjacency list isFigureThe storage organization of a kind of chain type.
The storage organization of linear linked list is as follows:
Similar function calls the Algorithms of Selecting in path and describes as follows:
First, the first head node from the set of alternative routing head node, each node calling path successively with original function compares, to the last the head node of an alternative routing.If path can be called at original function concentrate and find the original function identical with alternative routing and call path, illustrate that this alternative routing is the unchanged alternative routing of structure, then the original function found is called path and adds same functions to and call in the collection FCPS_Same of path;If path concentration can not be called at original function to find the function call path identical with alternative routing, illustrate that this alternative routing is the alternative routing of structure change, then alternative routing is done and processes further by using method findHighSimilar (), relatively alternative routing and original function call path concentration function and call the similarity in path, the original function of the highest similarity obtained calls path and adds similar function to and call in the collection FCPS_Similar of path.
Being that alternative routing is chosen in the process that similar function calls path using similar function to call path Algorithms of Selecting, it sometimes appear that an alternative routing has the original function of a plurality of high similarity to call path, then this alternative routing will corresponding multiple former test cases.For this situation, it is necessary to the concrete condition that tester changes according to software, from the multiple former test case chosen, select to be best suitable for the test case of alternative routing.
Step 24, test case is modified.
Call the corresponding relation between path according to test case function and the similar function chosen calls set of paths, concentrate from former test case and select test case, it is determined that multiplexing test use cases.In redaction program, owing to function to have been carried out the operation of deletion, interpolation or amendment, then when performing the multiplexing test case chosen, possibility can not cover the alternative routing to be measured of correspondence, therefore, before performing the test case of multiplexing, function and correlation function thereof are changed in manual analysis, and manual modification can not cover the multiplexing test case of alternative routing to be measured.
Call the corresponding relation between path according to test case function and the similar function chosen calls set of paths, concentrate from former test case and select test case, it is determined that multiplexing test use cases.In redaction program, owing to function to have been carried out the operation of deletion, interpolation or amendment, then when performing the multiplexing test case chosen, possibility can not cover the alternative routing to be measured of correspondence, therefore, before performing the test case of multiplexing, function and correlation function thereof are changed in manual analysis, and manual modification can not cover the multiplexing test case of alternative routing to be measured.
Choose in process what similar function called path, the factors such as software test budget, design test case expense and amendment test case expense can be considered, set path similarity threshold, for the maximum path Similarity value of alternative routing to be measured still less than similarity of paths threshold value in the case of, need to design new test case for this type of alternative routing to be measured, to reach to cover the effect of alternative routing to be measured.
Fig. 6Be one section of C programmer before changing with change after its corresponding function calling relationship of source codeFigure, according toFig. 6Analytic explanation further is done to how revising test case.
Function calling relationship according to original program with the program of changeFigure, it is possible to obtain the function call path of original program and the program of change;By analyzing the source code of original program and according to function calling relationshipFigure, design former test case.The function call path of original program and test caseSuch as table 2.3 shown in;The alternative routing of change program and change functionSuch as table 2.4 shown in.
Table 2.3 the function call path of original program and test case
Numbering/i | Function call path/pathi | Test case/ti |
1 | main,funF,funS,end | F=5, s=3; |
2 | main,funF,funS,funT,end | F=5, s=4; |
Table 2.4 alternative routing and change function
Numbering/i | Function call path/pathci | Change function |
1 | main,funF,funS,end | funS |
2 | main,funF,funS,funT,end | funS |
3 | main,funF,funS,funE,end | funS,funE |
Because function funS is modified, and with the addition of new function funE, so funS and funE is the change function of change program.It is { path according to the alternative routing collection final to be measured that alternative routing system of selection to be measured is determinedc1、pathc2、pathc3, calling path Algorithms of Selecting by similar function is alternative routing path to be measuredc1、pathc2And pathc3It is path respectively that the similar function chosen calls path1、path2And path1, call path according to the similar function chosen and test case function call the corresponding relation in path, alternative routing path to be measuredc1、pathc2And pathc3Corresponding multiplexing test case is t respectively1、t2And t1, it is determined that multiplexing test use cases be { t1, t2}.In changing function funS, have modified the condition of the if control statement of funS, and have invoked function funE, therefore, perform multiplexing test case and can not cover the alternative routing to be measured of correspondence, analyze and change the code changing part in function funS, the multiplexing test case that can not cover corresponding alternative routing to be measured is modified.
Amended multiplexing test case and corresponding alternative routing to be measuredSuch as table 2.5 shown in.
Table 2.5 alternative routing and test case
Numbering/i | Function call path/pathci | Test case/tci |
1 | main,funF,funS,end | F=5, s=4; |
2 | main,funF,funS,funT,end | F=5, s=5; |
3 | main,funF,funS,funE,end | F=5, s=6; |
pathc1Similar function to call path be path1, corresponding multiplexing test case is t1.Path path1Corresponding control condition is " sa%2==0 ", alternative routing path to be measuredc1Corresponding control condition is " sa%3==0 ", owing to control condition changes, performs multiplexing test case t1(f=5, s=3) can not cover alternative routing path to be measuredc1, accordingly, it would be desirable to from function funS, revise multiplexing test case t1, by t1(f=5, s=3) is revised as test case tc1(f=5, s=4), performs tc1After can cover alternative routing path to be measuredc1.In like manner, by alternative routing path to be measuredc2And pathc3Corresponding multiplexing test case t2(f=5, s=4) and t1(f=5, s=3) is revised as tc2(f=5, s=5) and tc3(f=5, s=6), makes amended multiplexing test case can cover the alternative routing to be measured of correspondence.
The above is the preferred embodiment of the present invention; it should be pointed out that, for those skilled in the art, under the premise without departing from principle of the present invention; can also making some improvements and modifications, these improvements and modifications also should be regarded as protection scope of the present invention.
Claims (4)
1. the Reuse of Test Cases method based on function call path, it is characterised in that including:
Step 1, utilize alternative routing defining method to be measured determine new version software needs test alternative routing collection, described alternative routing defining method to be measured includes: gathers and changes function information, and concentrate selection alternative routing from alternative routing, so that it is determined that the final alternative routing collection needing test;;
Step 2, generate multiplexing test case.
2. the Reuse of Test Cases method based on function call path according to claim 1, it is characterised in that described step 1 specifically includes:
Partial code is changed in step 11, analysis, it is determined that with the function that change function exists dependence;
Step 12, according to change function dependence function, it is determined that change function correlation function;
Step 13, the correlation function pair consisted of change function and correlation function, select alternative routing from all alternative routings of new version software program, it is determined that the final alternative routing collection needing to test.
3. the Reuse of Test Cases method based on function call path according to claim 1, it is characterised in that step 2 specifically includes:
Step 21, calling path Algorithms of Selecting according to similarity of paths computational methods and similar function, calculate alternative routing to be measured and original function and call the similarity in path, the original function choosing similarity high calls path;
Step 22, according to the result of calculation of similarity, alternative routing is classified, i.e. the alternative routing of structure change and the unchanged alternative routing of structure;
Step 23, analyze the change function of alternative routing, and according to changing the correlation function of function, amendment can not cover the test case of corresponding alternative routing to be measured, so that it is determined that final reusable test use cases.
4. the Reuse of Test Cases method based on function call path according to claim 3, it is characterised in that described step 2 also includes:
Step 24, test case is modified.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610140764.XA CN105808438B (en) | 2016-03-11 | 2016-03-11 | A kind of Reuse of Test Cases method based on function call path |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610140764.XA CN105808438B (en) | 2016-03-11 | 2016-03-11 | A kind of Reuse of Test Cases method based on function call path |
Publications (2)
Publication Number | Publication Date |
---|---|
CN105808438A true CN105808438A (en) | 2016-07-27 |
CN105808438B CN105808438B (en) | 2018-07-10 |
Family
ID=56468241
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610140764.XA Expired - Fee Related CN105808438B (en) | 2016-03-11 | 2016-03-11 | A kind of Reuse of Test Cases method based on function call path |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105808438B (en) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106776348A (en) * | 2017-02-06 | 2017-05-31 | 腾讯科技(深圳)有限公司 | Testing case management and device |
CN108446220A (en) * | 2018-03-02 | 2018-08-24 | 国网吉林省电力有限公司信息通信公司 | A kind of generation method and device of test case |
CN109828909A (en) * | 2018-12-21 | 2019-05-31 | 北京城市网邻信息技术有限公司 | Regression test case determines method, apparatus, electronic equipment and storage medium |
CN110262957A (en) * | 2019-04-12 | 2019-09-20 | 江西财经大学 | The method for reusing of test case and its system is realized between a kind of similar programs |
CN110389753A (en) * | 2019-06-06 | 2019-10-29 | 五八有限公司 | Chain type call method, device, electronic equipment and the storage medium of native applications |
CN114780439A (en) * | 2022-06-13 | 2022-07-22 | 江西财经大学 | Reuse method of test cases among similar programs facing to parameter path flow graph |
CN116383092A (en) * | 2023-05-31 | 2023-07-04 | 北京中科卓信软件测评技术中心 | Effective test case multiplexing method and device for software fuzzy test |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102253889A (en) * | 2011-08-07 | 2011-11-23 | 南京大学 | Method for dividing priorities of test cases in regression test based on distribution |
CN102831060A (en) * | 2012-08-24 | 2012-12-19 | 东南大学 | Modification influence analysis based regression test case updating method of part software |
CN102915271A (en) * | 2012-10-31 | 2013-02-06 | 北京邮电大学 | Method for optimizing unit regression test case set based on control flow diagram |
CN103092748A (en) * | 2011-11-07 | 2013-05-08 | 阿里巴巴集团控股有限公司 | Method and system of test cases surely needing to perform regression testing |
CN104536896A (en) * | 2015-01-12 | 2015-04-22 | 牟永敏 | Regression test case selecting and ranking method and system oriented to function call path |
-
2016
- 2016-03-11 CN CN201610140764.XA patent/CN105808438B/en not_active Expired - Fee Related
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102253889A (en) * | 2011-08-07 | 2011-11-23 | 南京大学 | Method for dividing priorities of test cases in regression test based on distribution |
CN103092748A (en) * | 2011-11-07 | 2013-05-08 | 阿里巴巴集团控股有限公司 | Method and system of test cases surely needing to perform regression testing |
CN102831060A (en) * | 2012-08-24 | 2012-12-19 | 东南大学 | Modification influence analysis based regression test case updating method of part software |
CN102915271A (en) * | 2012-10-31 | 2013-02-06 | 北京邮电大学 | Method for optimizing unit regression test case set based on control flow diagram |
CN104536896A (en) * | 2015-01-12 | 2015-04-22 | 牟永敏 | Regression test case selecting and ranking method and system oriented to function call path |
Cited By (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106776348A (en) * | 2017-02-06 | 2017-05-31 | 腾讯科技(深圳)有限公司 | Testing case management and device |
CN106776348B (en) * | 2017-02-06 | 2022-09-09 | 腾讯科技(深圳)有限公司 | Test case management method and device |
CN108446220A (en) * | 2018-03-02 | 2018-08-24 | 国网吉林省电力有限公司信息通信公司 | A kind of generation method and device of test case |
CN108446220B (en) * | 2018-03-02 | 2022-04-05 | 国网吉林省电力有限公司信息通信公司 | Test case generation method and device |
CN109828909A (en) * | 2018-12-21 | 2019-05-31 | 北京城市网邻信息技术有限公司 | Regression test case determines method, apparatus, electronic equipment and storage medium |
CN110262957A (en) * | 2019-04-12 | 2019-09-20 | 江西财经大学 | The method for reusing of test case and its system is realized between a kind of similar programs |
CN110389753A (en) * | 2019-06-06 | 2019-10-29 | 五八有限公司 | Chain type call method, device, electronic equipment and the storage medium of native applications |
CN110389753B (en) * | 2019-06-06 | 2024-01-23 | 五八有限公司 | Chained calling method and device of native application, electronic equipment and storage medium |
CN114780439A (en) * | 2022-06-13 | 2022-07-22 | 江西财经大学 | Reuse method of test cases among similar programs facing to parameter path flow graph |
CN114780439B (en) * | 2022-06-13 | 2022-09-27 | 江西财经大学 | Reuse method of test cases among similar programs facing parameter path flow graph |
CN116383092A (en) * | 2023-05-31 | 2023-07-04 | 北京中科卓信软件测评技术中心 | Effective test case multiplexing method and device for software fuzzy test |
CN116383092B (en) * | 2023-05-31 | 2023-08-01 | 北京中科卓信软件测评技术中心 | Effective test case multiplexing method and device for software fuzzy test |
Also Published As
Publication number | Publication date |
---|---|
CN105808438B (en) | 2018-07-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105808438A (en) | Test case reuse method based on function call path | |
CN109144882B (en) | Software fault positioning method and device based on program invariants | |
Wegbreit | Property extraction in well-founded property sets | |
US8793674B2 (en) | Computer-guided holistic optimization of MapReduce applications | |
Song et al. | Efficient alignment between event logs and process models | |
US7971193B2 (en) | Methods for performining cross module context-sensitive security analysis | |
Gotlieb et al. | Automated metamorphic testing | |
EP3674918B1 (en) | Column lineage and metadata propagation | |
Chen et al. | Coverage prediction for accelerating compiler testing | |
US20100070948A1 (en) | System and method for improving modularity of large legacy software systems | |
US20190317879A1 (en) | Deep learning for software defect identification | |
CN105868116A (en) | Semantic mutation operator based test case generation and optimization method | |
Švejda et al. | Interpretation-based violation witness validation for C: NitWit | |
US8996922B2 (en) | Mixed numeric and string constraint analysis | |
CN108228232B (en) | Automatic repairing method for circulation problem in program | |
Cheng et al. | Static analysis of spreadsheet applications for type-unsafe operations detection | |
Liuying et al. | Test selection from UML statecharts | |
CN117851101A (en) | Warehouse level code defect automatic repairing method based on large language model | |
CN107247663B (en) | Redundancy variant identification method | |
CN104536880A (en) | GUI program testing case augmentation method based on symbolic execution | |
CN107766253A (en) | A kind of method of the automatic maintenance test script based on model change | |
Saptawijaya et al. | Tabdual: a tabled abduction system for logic programs. | |
US7210128B2 (en) | Event-driven observability enhanced coverage analysis | |
CN101807225A (en) | Thickened oil numerical reservoir simulation method and device | |
Hatano et al. | Removing code clones from industrial systems using compiler directives |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180710 Termination date: 20200311 |
|
CF01 | Termination of patent right due to non-payment of annual fee |