Code-coverage guided prioritized test generation

A method comprising:

• (a) generating a first control-flow graph that is based on a program, wherein said 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.

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
• (d) generating a first test case for said program based on said first path and on said second path.