CN101901188A - Reachable path-based software testing method - Google Patents
Reachable path-based software testing method Download PDFInfo
- Publication number
- CN101901188A CN101901188A CN 201010235307 CN201010235307A CN101901188A CN 101901188 A CN101901188 A CN 101901188A CN 201010235307 CN201010235307 CN 201010235307 CN 201010235307 A CN201010235307 A CN 201010235307A CN 101901188 A CN101901188 A CN 101901188A
- Authority
- CN
- China
- Prior art keywords
- path
- program
- variable
- predicate
- section
- 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
- 238000000034 method Methods 0.000 title claims abstract description 47
- 238000013522 software testing Methods 0.000 title abstract 2
- 239000002243 precursor Substances 0.000 claims abstract description 5
- 238000004458 analytical method Methods 0.000 claims description 14
- 238000012360 testing method Methods 0.000 description 37
- 230000000875 corresponding effect Effects 0.000 description 5
- 230000003068 static effect Effects 0.000 description 5
- 230000002950 deficient Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 230000000052 comparative effect Effects 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 238000005034 decoration Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Abstract
The invention provides a reachable path-based software testing method. The method comprises the following steps of: 1, acquiring basic information of a program, wherein the basic information comprises the definition and the using information of a variable in a statement; 2, establishing an information linked list for each slice; 3, backwards traversing the program by using a graph reachability algorithm, marking a direct precursor node of the program according to a control and dependency relationship, and including a marked current node n to S(v); 4, judging whether an entry point of the program is reached; if the entry point of the program is not reached, continuing traversing the program backwards; and otherwise, stopping traversing to obtain a set, namely a path slice S, including a group of possible paths; and 5, analyzing the correlation of the variable from the first branch predicate of the path slice S. In the method, a reachable path is selected by two steps, namely a first step of determining a subset of paths and a second step of analyzing the paths in the set. Therefore, selection range is reduced and coverage sufficiency is easily realized.
Description
Technical field
What the present invention relates to is a kind of method for testing software.
Background technology
The essence of software test is the inner structure design test case according to the specification in each stage of software development and program, and goes to drive tested program with these test cases, the execution result of procedures of observation, and whether the checking The actual running results is consistent with expected result.The test case of choosing that holds water is that the core of software test is with crucial.Test case is directly and the structurally associated of program, so structured testing is particularly important, and it is the inner structure design test case according to program.This structured testing requires the architectural characteristic of tested program is accomplished to need to a certain degree covering to select a kind of coverage criterion and determine logical path.Each test case need be carried out specific path, and the problem that at first faces is exactly how to determine a path that can reach.Expending of generation of redundancy testing use-case and path generation can be effectively avoided in the selection of reachable path, thereby guarantees the adequacy of test.
Program slicing technique is the technology of a kind of analysis and prehension program, has and can simplify problem, dwindles the characteristics of target zone, has a wide range of applications at numerous areas such as software maintenance, program debug, test, code understandings.Its principle and method are to be put forward first in the PhD dissertation at him in 1979 by Mark Weiser.After this, on his basis, there are many people to propose different program slice definition and section algorithm again, program slice algorithm comprising the Horwitz proposition, he expands to system dependence graph (SDG) with program dependency graph (PDF), has solved the problem that can't solve the invocation of procedure in the algorithm that Weiser proposes; And the condition microtomy of Canfora proposition; Dynamic Slicing notion that Korel and Laski propose or the like.Software test based on program slice is a kind of with program or program and the test that need be integrated as the basis, cuts into slices according to the difference of program and dwindles the test specification of software, and improve the efficient of software test.Simultaneously because the various dependences that program slice consideration program exists (being not only that data dependence and control rely on) make the accuracy of test be improved.
At present, mainly contain two kinds for definite method of reachable path: the one, the eliminating in unreachable path, the 2nd, the selection of reachable path.The eliminating in unreachable path mainly is divided into static method and dynamic approach.
Document " reachable path based on minimum predicate thought is selected " points out that (CNKI) there is very big defective in traditional unreachable path method for removing:
(1) by static analysis, determine the branch interference of existence, thereby exclude unreachable path, but this method efficient is lower, and be subjected to the influence of static analysis method, means, it almost is impossible differentiating all unreachable paths.
(2) dynamic approach has following shortcoming owing to it is exploratory:
1. before definite certain paths is unreachable path, carry out search repeatedly, expend bigger for the probing test use-case.
2. for the narrow reachable path of test domain,, may be excluded, directly affect the adequacy of test because of its test case is difficult for searching.
When (3) producing test case with the symbol executive mode, when separating the predicate system of equations, can separating, not having to separate and judge unreachable path by system of equations.But the defective of symbolic excution methodology is present in the judgement aspect in unreachable path too, and therefore unreachable routing problem needs more effective solution.
Document " selecting based on the reachable path of minimum predicate thought " points out actively to select the thought of reachable path can reduce the generation in unreachable path effectively simultaneously, has the following advantages based on the thought of reachable path:
1. the generation of redundancy testing use-case not only can be effectively avoided in the unreachable path of early stage eliminating, more because of its decision-making before the path generates, makes that generating expending also of redundant path is avoided.
2. avoid from complete path covers, influencing the whole coverage rate of test, thereby guarantee the adequacy of test because of excluding the unreachable path of part.
The system of selection of reachable path mainly contains reachable path back-and-forth method, the detection branch interference method of minimum predicate method, application data stream and control stream.But these algorithms can influence reached at the effect in path equally owing to the difference that realizes, therefore, need find a kind of effective method to improve the defective of present reachable path selection algorithm.
Based on the test philosophy in path be require in the various test philosophies the highest a kind of, but because the existence of path Reachability question has reduced the testing efficiency based on the path.Therefore how analyze effectively and select the path to be based on a key issue in the path testing, select the path can improve the efficient of software test effectively accurately.For the analysis of path accessibility, be to select the path that test case is carried out in the path that chooses from another angle analysis.Simultaneously also for the software test work based on the path provide better early stage result, thereby the efficient that improves test guarantees the quality of software.Directly analyzing reachable path has the following advantages: the first, and get rid of unreachable path in early days and can effectively avoid expending of redundancy testing use-case generation; The second, avoid the unreachable path of part and influence the coverage rate of test, thereby guarantee the adequacy of test.
Summary of the invention
The object of the present invention is to provide a kind of method for testing software based on reachable path that can improve the efficiency of selection and the accuracy in path.
The object of the present invention is achieved like this:
The implication of the path section notion that relates among the present invention is as follows:
The multiple-limb situation that exists in the program has caused the complicacy of program, and these branch's orientations are by various dependence influenced.Microtomy has been considered the various dependences (being not only that data rely on and the control dependence) that exist in the program, makes the accuracy of test be improved.The most basic dependence is between the statement in the program, mainly is that data dependence, common dependence and control rely on.Any one program can with the union equivalence of batch processing section, be exactly to have tested whole procedure so test each section reality, thereby guaranteed the adequacy of test.
Definition 1 (path section) program P, section criterion C＜n, V 〉.With the n in the section criterion is specified point, obtains the S that cuts into slices for analyzing the possible path that can reach n, claims that section S is the path section.
The definition 2 (section paths) for the section S (n, V, static).Analysis obtains one group of possible path p1, p2 ..., pn, path wherein is called the section path.
The application program microtomy is obtained the path section, and then selects the process of reachable path mainly to be divided into following steps.
Step 1: the essential information of collection procedure comprises the definition and the use information of the variable that statement occurs;
Step 2 a: information chained list is set up in each section;
Step 3: to traversal program,, the present node n of mark is covered S (v) behind the application drawing accessibility algorithm according to control and its direct precursor node of dependence mark;
Step 4: judge whether the entrance of the program that arrives, if also do not arrive the entrance of program then continue the back to traversal program, otherwise stopping to travel through the set that obtains comprising one group of possible path is path section S;
Step 5: the correlativity that begins situational variables from first branch's predicate of path section S.The accessibility of analysis path is promptly analyzed the value of section predicate variable expression formula in the path section that obtains.From the section entrance, rely on path label information again according to data dependence and control, mainly be to finish the variable in branch's predicate in the path is analyzed, judge the value of predicate node, its value has three kinds of possibility: true, false and undef, wherein true and false represent corresponding predicate variable by definite value (getting true or false all the time), undef represents that the value of corresponding predicate variable is relevant with actual motion.If can reach the section variable of appointment by the judgement to predicate variable, promptly this path be for reaching, otherwise is unreachable.Wherein can reach and also be divided into all the time and can reach, be meant that can specified point all the time in the branch of branch's predicate value, with relevant the reaching of input, be meant its input value that reach the program of depending on.Up to all predicate variables in the section of path have all been analyzed.
The present invention selects the reachable path that program slice is applied in the program structure, proposes a kind of routing algorithm based on program slice, in order that improve the efficiency of selection and the accuracy in path.The generation of redundancy testing use-case not only can be effectively avoided in the unreachable path of early stage eliminating, more because of its decision-making before the path generates, makes that generating expending also of redundant path is avoided.
Can the simplify procedures function of structure of application program microtomy is applied in the early stage of routing with this.In the early stage of analyzing reachable path, the section that obtains by program slicing technique comprises one group of set that can arrive the path of point of interest.The set in such path has comprised all possible path from program entry to the appointment point of interest, and avoiding influences the whole coverage rate of test because of excluding the unreachable path of part from complete path covers, thereby guarantees the adequacy of test.
Employing figure accessibility algorithm calculates the program slice that meets the demands.Use static back tangential section criterion, before the program exit point must being point of interest through node, the back is to this program of traversal, and the variable in search and the corresponding point of interest has the node of direct or indirect relation, and the node set that obtains like this is the required section that comprises one group of path.In ergodic process, consider the dependence between the basic statement in the back, further constructor dependency graph and system dependence graph on these dependence bases.
Contrast other reachable path system of selection, the path microtomy that the present invention proposes has the following advantages: this method is analyzed the selection reachable path in two steps, and the first step is determined the subclass in path, second step analysis path in set.Finish the selection in path in two steps, dwindled the scope of selecting, realize the adequacy that covers easily.
Description of drawings
Fig. 1 is a reachable path selection algorithm process flow diagram of the present invention.
Embodiment
For example the present invention is done description in more detail below in conjunction with accompanying drawing:
The invention discloses a kind of method for testing software based on reachable path, will the specific embodiment of the present invention be described in detail in detail according to process flow diagram 1 below, process flow diagram as shown in Figure 1.Mainly comprise following committed step:
Step 1: the essential information of collection procedure comprises the definition and the use information of the variable that statement occurs;
This process is: establish program P, (t) expression variable v defines in statement n Definition for v, n, and wherein t represents at every turn definition to variable v is distinguished in the definition of variable v according to this, and Def (represents that v) all gather the definite value point of variable v; (n v) is illustrated in reference to variable v among the statement n to Using, and Use (represents v) that to the set of the invocation point of variable v GEN (v) represents the definition of variable v and the set of the information quoted.
GEN(v)＝Def(v)UUse(v)
In this course, even certain variable may be redefined after definition, such information also can go on record, and just can distinguish by t, also shows the number of times that variable v is defined.
Step 2 a: information chained list is set up in each section;
Owing to may have a plurality of section variablees in the program, the essential information of the program that different section criterion C relates to also is not quite similar.With criterion C＜n, v, backward〉back forerunner's node of directly or indirectly being correlated with to the traversal program mark, obtain the path section, make S set (v)
Expression section criterion C＜n, v, backward〉in the essential information collection of section variable v, statement n, variable v:
S (v) represents to be the path section with the form of chained list, needs the data in the consideration program to rely on and the control dependence in generating the chained list process.
Step 3: to traversal program,, the present node n of mark is covered S (v) behind the application drawing accessibility algorithm according to control and its direct precursor node of dependence mark;
In the algorithm of this class based on the figure accessibility, general main program dependency graph and the system dependence graph of being meant can reach.Below these two kinds of dependency graphs are elaborated.
1. program dependency graph (PDG): PDG is a kind of diagrammatic representation of program, and it relies on control and the data dependence is included in the single structure.If statement X and Y in the preset sequence, then X and Y can come associated with each other by control stream or data stream.If can draw two paths at least from Y, wherein federation causes the execution of X, and another may cause X not carry out, and then claims statement X control to depend on statement Y; If a path from Y to X is arranged, and exist one to be defined in the variable that the X point uses, and this variable then claim statement X data to depend on statement Y in that other is not redefined Anywhere on the path from Y to X at the Y point.The formal definition of PDG is to rely on subgraph (CDG) by a control, and a control flow graph (CFG) and data rely on subgraph (DDG) and form.Wherein CDG has comprised the control dependence in the program; CFG has described the control stream in the program, and it is similar to the flow graph under the normal condition; DDG is the set that all data rely between the statement in the program.CDG comprises the node of several types, i.e. statement in the statement node representation program; The territory node has been summarized the dependence of the control between statement in the territory; Strategy or branch condition in predicate node (can draw two limits thus) representation program.Domain node among the CDG can utilize identical control to rely on to gather statement.The data that DDG comprises between statement rely on.Can construct DDG by between the node of CDG, inserting the data dependence edge.
2. system dependence graph (SDG): SDG is a kind of grammatical analysis tree representation of program.Node is represented program structure (constructs), input (in, out parameter) and calling station etc.Various dependences between the node that the limit is represented to be attached thereto (for example data rely on, control dependence and statement etc.).The program dependency graph normally defines for the program of single process.Because the program of real world generally is made up of a plurality of processes, so must consider to use a kind of method for expressing that is complementary with real-world programs, so S.Horwitz, people such as T.Reps and D.Binkley have proposed system dependence graph.SDG is a parse tree through the representation program of decoration.Say that form SDG is the multigraph of oriented, the tape label that is made of a program dependency graph and one group of process dependency graph (PrDG).Master routine in the PrDG modelling software systems: a plurality of procedure bodies in the PrDG modelling software systems.Data stream and control that SDG can be used between processing procedure are flowed, and can represent the parameter transmission.
Figure accessibility algorithm is an algorithm with extendability, and service routine dependency graph (PDG) can be used for calculating the program slice of single process, and only needs further using system dependency graph (SDG) just can further be handled when handling many processes.
Step 4: judge whether the entrance of the program of traversing, if also do not arrive the entrance of program then continue the back to traversal program, otherwise stopping to travel through the set that obtains comprising one group of possible path is path section S;
Step 5: the correlativity that begins situational variables from first branch's predicate of path section S.The accessibility of analysis path is promptly analyzed the value of section predicate variable expression formula in the path section that obtains.From the section entrance, rely on path label information again according to data dependence and control, mainly be to finish the variable in branch's predicate in the path is analyzed, judge the value of predicate node, its value has three kinds of possibility: true, false and undef, wherein true and false represent corresponding predicate variable by definite value (getting true or false all the time), undef represents that the value of corresponding predicate variable is relevant with actual motion.If can reach the section variable of appointment by the judgement to predicate variable, promptly this path be for reaching, otherwise is unreachable.Wherein can reach and also be divided into all the time and can reach, be meant that can specified point all the time in the branch of branch's predicate value, with relevant the reaching of input, be meant its input value that reach the program of depending on.Up to all predicate variables in the section of path have all been analyzed.
The process of the system of selection of following utilization structure language expression reachable path
// the essential information of collection procedure at first
For (i=0; I＜var_num; I++) //i is the variable number
GEN (v)=(v) U Use is (v) for Def; // each variable is set up an information chained list
// according to section criterion C＜n, v 〉, application drawing can reach algorithm and produce section
Begin SliceProcedure (node) //the node brief note is n, i.e. specified node
while(n！＝Entry)
{ // begin the back to traversal from specifying node n
if(n＝＝unmark_nodes&&n＝＝immediate?predecessor?nodes)
{
S (v)=and S (v)+n; // according to control and its direct precursor node of dependence mark
// the current node n of mark is covered S (v)
} // the arrive entrance of program up to n
}
End?SliceProcedure；
// first branch's predicate from the section of path begins to analyze the correlativity of predicate variable
For (i=1; I＜n
pI++) //n
pNumber for the predicate variable in the specified path section
{
If (Def (v
p)==NULL) // variable v
pIt is predicate variable
{
The path to slicing variable is feasible; // predicate variable v
p, cut into slices not by definite value before
Variable depends on the program input
}
If (Def (v
p)!=NULL) // current predicate variable v
pBe defined before
{
If (exp 〉=0) //exp is the predicate expression formula
If (n ∈ Def (v
p)) // cut into slices variable v in true branch
slicing?variable?included?ture?branch；
else
This path isinfeasiblel; // specify node not in true branch
else
if(exp＜0)
If (n ∈ Def (v
p)) // cut into slices variable v on false ramification
slicing?variable?included?false?branch；
else
This path is infeasible; // specify node not on false ramification
}
Feasible?Path
The execution flow process of above-mentioned algorithm is described with an example concrete analysis below, secondary series is represented with criterion C＜(16) in the table 1, n, backwork〉back to the directly or indirectly relevant forerunner's node of traversal program mark, the section of the path that obtains, the 3rd tabulation are shown in the path section that previous step obtains and go up the path set of slices that obtains after the accessibility of analysis path.
The analysis of table 1 examples comparative
Contrast other reachable path systems of selection of mentioning in this instructions, the section routing resource that the present invention proposes has remarkable advantages, and the simple contrast between them is as shown in table 2:
The contrast of table 2 routing algorithm
Claims (1)
1. method for testing software based on reachable path is characterized in that:
Step 1: the essential information of collection procedure comprises the definition and the use information of the variable that statement occurs;
Step 2 a: information chained list is set up in each section;
Step 3: to traversal program,, the present node n of mark is covered S (v) behind the application drawing accessibility algorithm according to control and its direct precursor node of dependence mark;
Step 4: judge whether the entrance of the program that arrives, if also do not arrive the entrance of program then continue the back to traversal program, otherwise stopping to travel through the set that obtains comprising one group of possible path is path section S;
Step 5: the correlativity that begins situational variables from first branch's predicate of path section S, the accessibility of analysis path is promptly analyzed the value of section predicate variable expression formula in the path section that obtains, from the section entrance, rely on path label information again according to data dependence and control, finish the variable in branch's predicate in the path is analyzed, judge the value of predicate node, its value has three kinds of possibility: true, false and undef, wherein true and false represent that corresponding predicate variable is by definite value, promptly get true or false all the time, undef represents that the value of corresponding predicate variable is relevant with actual motion, if can reach the section variable of appointment by judgement to predicate variable, promptly this path is for reaching, otherwise be unreachable, wherein can reach be divided into can reach all the time be meant specified point all the time in the branch of branch's predicate value with the relevant input value that can reach the program of depending on that is meant it that reaches of input, all predicate variables in being cut into slices in the path have all been analyzed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102353071A CN101901188B (en) | 2010-07-23 | 2010-07-23 | Reachable path-based software testing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102353071A CN101901188B (en) | 2010-07-23 | 2010-07-23 | Reachable path-based software testing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101901188A true CN101901188A (en) | 2010-12-01 |
| CN101901188B CN101901188B (en) | 2012-02-01 |
Family
ID=43226737
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102353071A Expired - Fee Related CN101901188B (en) | 2010-07-23 | 2010-07-23 | Reachable path-based software testing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101901188B (en) |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102214141A (en) * | 2011-07-02 | 2011-10-12 | 中国矿业大学 | Real-time stack-based program slicing method |
| CN102681939A (en) * | 2012-05-07 | 2012-09-19 | 北京邮电大学 | Method and device for selecting path |
| CN102968375A (en) * | 2012-11-30 | 2013-03-13 | 中国矿业大学 | Inaccessible path detection method based on association rule mining |
| CN103019862A (en) * | 2012-12-13 | 2013-04-03 | 北京神州绿盟信息安全科技股份有限公司 | Symbolic execution method, device and system |
| CN103116540A (en) * | 2013-01-23 | 2013-05-22 | 电子科技大学 | Dynamic symbolic execution method and device thereof based on overall situation super block dominator graph |
| CN103399902A (en) * | 2013-07-23 | 2013-11-20 | 东北大学 | Generation and search method for reachability chain list of directed graph in parallel environment |
| CN103455421A (en) * | 2013-08-19 | 2013-12-18 | 西安交通大学 | Regression testing case generation method based on program control dependence guide |
| CN103559122A (en) * | 2013-10-14 | 2014-02-05 | 西安交通大学 | Test case reduction method based on program behavior slices |
| CN104572476A (en) * | 2015-01-30 | 2015-04-29 | 南京邮电大学 | Software safety testing method based on program slicing |
| CN104866417A (en) * | 2014-02-25 | 2015-08-26 | 华为技术有限公司 | Path-sensitive detection method and device |
| CN105446881A (en) * | 2015-11-26 | 2016-03-30 | 福建工程学院 | Automatic detection method for program unaccessible paths |
| CN107391124A (en) * | 2017-06-30 | 2017-11-24 | 东南大学 | A kind of condition dicing method based on golden section search and software perform track |
| CN107844408A (en) * | 2016-09-18 | 2018-03-27 | 中国矿业大学 | A kind of similar execution route generation method based on hierarchical clustering |
| CN108536606A (en) * | 2018-04-22 | 2018-09-14 | 北京化工大学 | A kind of EFSM test methods based on complex dependence relationship coverage criterion |
| CN109815153A (en) * | 2019-02-19 | 2019-05-28 | 北京天诚同创电气有限公司 | The static slicing method and apparatus of PLC program and motor start-up and shut-down control program |
| CN109885292A (en) * | 2019-01-31 | 2019-06-14 | 中国人民解放军61660部队 | Program slice method and computer readable storage medium based on function logics |
| CN113168603A (en) * | 2018-12-21 | 2021-07-23 | Abb瑞士股份有限公司 | System and method for workload estimation |
| CN114817927A (en) * | 2022-03-30 | 2022-07-29 | 北京邮电大学 | Effective symbol execution method and device based on branch covering guidance |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101201740A (en) * | 2007-10-12 | 2008-06-18 | 北京赛柏科技有限责任公司 | Method for generating test case based on process model |
| CN101216803A (en) * | 2008-01-09 | 2008-07-09 | 四川大学 | Test program control stream path set creation method based on base path |
| CN101436128A (en) * | 2007-11-16 | 2009-05-20 | 北京邮电大学 | Software test case automatic generating method and system |
| CN101833499A (en) * | 2010-04-07 | 2010-09-15 | 南京航空航天大学 | Software testing validating method based on reachability tree |
-
2010
- 2010-07-23 CN CN2010102353071A patent/CN101901188B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101201740A (en) * | 2007-10-12 | 2008-06-18 | 北京赛柏科技有限责任公司 | Method for generating test case based on process model |
| CN101436128A (en) * | 2007-11-16 | 2009-05-20 | 北京邮电大学 | Software test case automatic generating method and system |
| CN101216803A (en) * | 2008-01-09 | 2008-07-09 | 四川大学 | Test program control stream path set creation method based on base path |
| CN101833499A (en) * | 2010-04-07 | 2010-09-15 | 南京航空航天大学 | Software testing validating method based on reachability tree |
Cited By (34)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102214141B (en) * | 2011-07-02 | 2013-11-06 | 中国矿业大学 | Real-time stack-based program slicing method |
| CN102214141A (en) * | 2011-07-02 | 2011-10-12 | 中国矿业大学 | Real-time stack-based program slicing method |
| CN102681939A (en) * | 2012-05-07 | 2012-09-19 | 北京邮电大学 | Method and device for selecting path |
| CN102681939B (en) * | 2012-05-07 | 2014-12-10 | 北京邮电大学 | Method and device for selecting path |
| CN102968375B (en) * | 2012-11-30 | 2015-10-28 | 中国矿业大学 | Based on the infeasible paths detection method of association rule mining |
| CN102968375A (en) * | 2012-11-30 | 2013-03-13 | 中国矿业大学 | Inaccessible path detection method based on association rule mining |
| CN103019862B (en) * | 2012-12-13 | 2015-08-19 | 北京神州绿盟信息安全科技股份有限公司 | A kind of symbolic excution methodology, Apparatus and system |
| CN103019862A (en) * | 2012-12-13 | 2013-04-03 | 北京神州绿盟信息安全科技股份有限公司 | Symbolic execution method, device and system |
| CN103116540B (en) * | 2013-01-23 | 2015-02-18 | 电子科技大学 | Dynamic symbolic execution method based on overall situation super block dominator graph |
| CN103116540A (en) * | 2013-01-23 | 2013-05-22 | 电子科技大学 | Dynamic symbolic execution method and device thereof based on overall situation super block dominator graph |
| CN103399902A (en) * | 2013-07-23 | 2013-11-20 | 东北大学 | Generation and search method for reachability chain list of directed graph in parallel environment |
| CN103455421A (en) * | 2013-08-19 | 2013-12-18 | 西安交通大学 | Regression testing case generation method based on program control dependence guide |
| CN103455421B (en) * | 2013-08-19 | 2016-08-10 | 西安交通大学 | The regression test case guided based on program control dependence generates method |
| WO2015054938A1 (en) * | 2013-10-14 | 2015-04-23 | 西安交通大学 | Method for test case reduction based on program behavior slices |
| CN103559122A (en) * | 2013-10-14 | 2014-02-05 | 西安交通大学 | Test case reduction method based on program behavior slices |
| CN103559122B (en) * | 2013-10-14 | 2016-04-27 | 西安交通大学 | Test cases based on program behavior section about subtracts method |
| US9355019B2 (en) | 2013-10-14 | 2016-05-31 | Xi'an Jiaotong University | Method for test case reduction based on program behavior slices |
| CN104866417A (en) * | 2014-02-25 | 2015-08-26 | 华为技术有限公司 | Path-sensitive detection method and device |
| CN104866417B (en) * | 2014-02-25 | 2018-01-02 | 华为技术有限公司 | Path-sensitive detection method and device |
| CN104572476A (en) * | 2015-01-30 | 2015-04-29 | 南京邮电大学 | Software safety testing method based on program slicing |
| CN104572476B (en) * | 2015-01-30 | 2017-06-30 | 南京邮电大学 | A kind of infeasible paths detection method based on program slice |
| CN105446881A (en) * | 2015-11-26 | 2016-03-30 | 福建工程学院 | Automatic detection method for program unaccessible paths |
| CN107844408A (en) * | 2016-09-18 | 2018-03-27 | 中国矿业大学 | A kind of similar execution route generation method based on hierarchical clustering |
| CN107391124A (en) * | 2017-06-30 | 2017-11-24 | 东南大学 | A kind of condition dicing method based on golden section search and software perform track |
| CN107391124B (en) * | 2017-06-30 | 2020-06-16 | 东南大学 | Conditional slicing method based on golden section search and software execution track |
| CN108536606A (en) * | 2018-04-22 | 2018-09-14 | 北京化工大学 | A kind of EFSM test methods based on complex dependence relationship coverage criterion |
| CN108536606B (en) * | 2018-04-22 | 2021-01-19 | 北京化工大学 | EFSM test method based on composite dependency coverage criterion |
| CN113168603A (en) * | 2018-12-21 | 2021-07-23 | Abb瑞士股份有限公司 | System and method for workload estimation |
| CN109885292A (en) * | 2019-01-31 | 2019-06-14 | 中国人民解放军61660部队 | Program slice method and computer readable storage medium based on function logics |
| CN109885292B (en) * | 2019-01-31 | 2022-04-15 | 中国人民解放军61660部队 | Program slicing method based on function logic and computer readable storage medium |
| CN109815153A (en) * | 2019-02-19 | 2019-05-28 | 北京天诚同创电气有限公司 | The static slicing method and apparatus of PLC program and motor start-up and shut-down control program |
| CN109815153B (en) * | 2019-02-19 | 2024-01-26 | 北京天诚同创电气有限公司 | Static slicing method and device for PLC program and motor start-stop control program |
| CN114817927A (en) * | 2022-03-30 | 2022-07-29 | 北京邮电大学 | Effective symbol execution method and device based on branch covering guidance |
| CN114817927B (en) * | 2022-03-30 | 2024-01-09 | 北京邮电大学 | Effective symbol execution method based on branch coverage guidance |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101901188B (en) | 2012-02-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101901188B (en) | Reachable path-based software testing method | |
| Ciancia et al. | Spatio-temporal model checking of vehicular movement in public transport systems | |
| JP4398703B2 (en) | Apparatus, system, and storage medium for testing digital circuit | |
| Nayak et al. | Automatic Test Data Synthesis using UML Sequence Diagrams. | |
| Macia et al. | Supporting the identification of architecturally-relevant code anomalies | |
| Gong et al. | Automatic detection of infeasible paths in software testing | |
| Fatiregun et al. | Evolving transformation sequences using genetic algorithms | |
| CN102419728A (en) | Method for determining software test process sufficiency based on coverage rate quantitative indicators | |
| CN103294594A (en) | Test based static analysis misinformation eliminating method | |
| Meyer et al. | Identifying important classes of large software systems through k-core decomposition | |
| US20180095861A1 (en) | Automated Test Generation for Structural Coverage for Temporal Logic Falsification of Cyber-Physical Systems | |
| CN106708739A (en) | Extended finite state machine (EFSM) model-based Web service case generation method and system | |
| CN105159827A (en) | Reliability accelerated testing method for GUI software | |
| KR20170078770A (en) | Application testing | |
| CN108304317B (en) | Single-process program static slicing method and system based on path execution frequency | |
| Rabinovich et al. | Analyzing the behavior of event processing applications | |
| CN109002712B (en) | Pollution data analysis method and system based on value dependency graph and electronic equipment | |
| CN106294136A (en) | The online test method of concurrent program run duration performance change and system | |
| Lin et al. | A priority based path searching method for improving hybrid fuzzing | |
| CN108629124B (en) | Method for automatically generating simulation parameter data based on active graph path | |
| Swain et al. | Test case design using slicing of UML interaction diagram | |
| Domshlak et al. | The complexity of optimal monotonic planning: The bad, the good, and the causal graph | |
| CN107391124B (en) | Conditional slicing method based on golden section search and software execution track | |
| CN104199649A (en) | Path profiling method for interaction information between parent process and child process | |
| Boyer | Subgraph Homeomorphism via the Edge Addition Planarity Algorithm. |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20101201 Assignee: Harbin Tianda Control Engineering Co., Ltd. Assignor: Harbin Engineering Univ. Contract record no.: 2013230001792 Denomination of invention: Reachable path-based software testing method Granted publication date: 20120201 License type: Exclusive License Record date: 20130916 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| EC01 | Cancellation of recordation of patent licensing contract |
Assignee: Harbin Tianda Control Engineering Co., Ltd. Assignor: Harbin Engineering Univ. Contract record no.: 2013230001792 Date of cancellation: 20150717 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Application publication date: 20101201 Assignee: Harbin Tianda control Limited by Share Ltd Assignor: Harbin Engineering Univ. Contract record no.: 2015230000096 Denomination of invention: Reachable path-based software testing method Granted publication date: 20120201 License type: Exclusive License Record date: 20150721 |
|
| LICC | Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120201 Termination date: 20180723 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |