Table 1 Summary of the notation used in this paper
From: REDUNET: reducing test suites by integrating set cover and network-based optimization
Symbol | Name | Description |
|---|---|---|
\({\mathcal {T}}\) | Test suite | The initial set of test cases |
\(\mathcal {T'}\) | Optimised test suite | Resulting set of test cases, which minimise the execution time |
\(S_t\) | Test case coverage | The set of instructions covered by test case t |
\(\mathcal {S_T}\) | Test suite coverage | Set of instructions covered by at least one test case in \({\mathcal {T}}\) |
\(c_t\) | Execution time (cost) | Execution time of test case t |
\(x_t\) | Test selection variable | Binary variable valued 1 if the test case t is taken, 0 otherwise |
G | CFG | The control flow graph of the program under testing |
V | Vertices | Set of vertices in a CFG |
E | Edges | Set of edges in a CFG |
v,u | Vertex | A vertex of a CFG, corresponding to an instruction |
e | Edge | An edge of a CFG, showing contiguous instructions or a jump |