Code-coverage guided prioritized test generation
View Patent ↗A method for generating test cases for a program is disclosed. The method combines features of path-oriented and goal-oriented software testing. The illustrative embodiment constructs a control-flow graph with nodes that correspond to invocations of subroutines, and constructs control-flow graphs for the source code of such nodes as well. A metric that is based on the topology of the control-flow graph is evaluated recursively for nodes of the graph and for control-flow graphs that correspond to invoked subroutines. In the illustrative embodiment, the metric employed is the length of a shortest path from the starting node to a particular node. A node n with the highest metric value is then selected as a goal, and a path from the starting node to the ending node that passes through node n is generated via backtracking.
1. A method comprising:
(a) generating a first path from the starting node of a control-flow graph to a goal node of said control-flow graph based on the values of a metric for one or more other nodes of said control-flow graph;
(b) generating a second path from said goal node to an ending node of said control-flow graph; and
(c) generating, based on the concatenation of said first path and said second path, a first test case for the program from which said control-flow graph is derived.
2. The method of claim 1 wherein the value of said metric for said goal node is at least as great as for any other node in said control-flow graph.
3. The method of claim 1 wherein said metric is based on the topology of said control-flow graph.
4. The method of claim 3 wherein each node of said control-flow graph is associated with a corresponding weight; and wherein the value of said metric for at least one node of said control-flow graph is based on a weight associated with another node of said control-flow graph.
5. The method of claim 4 wherein the weight associated with a node of said control-flow graph equals the number of lines of code of said program represented by said node.
6. The method of claim 4 wherein said metric for a node of said control-flow graph is the length of a shortest path from the starting node of said control-flow graph to said node; and wherein the length of a path equals the sum of the weights of nodes on said path.
7. The method of claim 1 further comprising:
(d) generating, based on said first path and said second path, updated values of said metric for nodes of said control-flow graph;
(e) generating a third path from the starting node of said control-flow graph to an ending node of said control-flow graph, wherein said third path includes a node having the largest updated value; and
(f) generating, based on said third path, a second test case for said program.
8. The method of claim 7 wherein each node of said control-flow graph is associated with a corresponding weight; and wherein said metric for a node n is the length of a shortest path to n from any node of a previously-generated path; and wherein the length of a path equals the sum of the weights of nodes on said path.
9. A method comprising:
(a) generating a first control-flow graph that is based on a program, wherein said first control-flow graph comprises a node that represents a single line of code of said program that invokes a subroutine, and wherein said node has one or both of a single incoming arc and a single outgoing arc;
(b) generating a first path from the starting node of said first control-flow graph to an ending node of said first control-flow graph; and
(c) generating a first test case for said program based on said path.
10. The method of claim 9 wherein generating said first path is based on the values of a metric for nodes of said first control-flow graph.
11. The method of claim 10 wherein said metric is based on the topology of said first control-flow graph.
12. The method of claim 10 wherein each node of said first control-flow graph is associated with a corresponding weight; and
wherein the weight associated with a node that lacks a subroutine invocation equals the number of lines of code of said program represented by said node; and
wherein the weight associated with a node that invokes a subroutine equals the largest value of said metric among nodes of a second control-flow graph that is derived from said subroutine; and
wherein the value of said metric for at least one node of said first control-flow graph is based on a weight associated with another node of said first control-flow graph.
13. The method of claim 12 wherein each node of a control-flow graph is associated with a corresponding weight; and wherein said metric for a node of a control-flow graph is the length of a shortest path from the starting node of said control-flow graph to said node; and wherein the length of a path equals the sum of the weights of nodes on said path.
14. The method of claim 12 wherein each node of said first control-flow graph is associated with a corresponding weight, said method further comprising:
(d) generating updated values of said metric for nodes of said second control-flow graph;
(e) generating, based on at least one of said updated values of said second control-flow graph, an updated weight for the node of said first control-flow graph that corresponds to said second control-flow graph;
(f) generating updated values of said metric for nodes of said first control-flow graph based on said first path and on said updated weight;
(g) generating a second path from the starting node of said first control-flow graph to an ending node of said first control-flow graph, wherein said second path includes a node of said first control-flow graph having the largest updated value; and
(h) generating, based on said second path, a second test case for said program.
15. The method of claim 14 wherein said metric for a node n of said first control-flow graph is the length of a shortest path to n from any node of a previously-generated path; and wherein the length of a path equals the sum of the weights of nodes on said path.
16. A method comprising:
(a) generating a first control-flow graph that is based on a subroutine of a program;
(b) generating a second control-flow graph that is based on said program, wherein said second control-flow graph comprises a node n that represents a single line of code of said program that invokes said subroutine, and wherein node n has one or both of a single incoming arc and a single outgoing arc;
(c) generating a first path from the starting node of said first control-flow graph to an ending node of said first control-flow graph;
(d) generating a second path from the starting node of said second control-flow graph to an ending node of said second control-flow graph that includes node n; and
(e) generating a first test case for said program based on said first path and on said second path.
17. The method of claim 16 wherein generating said first path is based on the values of a metric for nodes of said first control-flow graph; and wherein generating said second path is based on the values of said metric for nodes of said second control-flow graph.
18. The method of claim 17 wherein said metric for a node of a control-flow graph is based on the topology of said control-flow graph.
19. The method of claim 17 wherein said metric for a node of a control-flow graph is the length of a shortest path from the starting node of said control-flow graph to said node; and wherein each node of said control-flow graph is associated with a corresponding weight; and wherein the length of a path equals the sum of the weights of nodes on said path.
20. The method of claim 17 wherein each node of said second control-flow graph is associated with a corresponding weight; and wherein the weight of a first node of said second control-flow graph equals the largest value of said metric among nodes of said first control-flow graph; and wherein the weight of a second node of said second control-flow graph equals the number of lines of code of said program represented by second node; and wherein said metric for a node of said second control-flow graph is based on at least one weight associated with another node of said second control-flow graph.