Skip to main content

Table 3 Approaches. Description of approaches compared in this experimental analysis

From: REDUNET: reducing test suites by integrating set cover and network-based optimization

Approach

Description

Do nothing

No optimisation performed, just the initial test suite is returned

Greedy

Greedy algorithm for set cover, previously adopted by Smith and Kapfhammer (2009)

HGS

Harrold Gupta Soffa (HGS) test-reduction method (Harrold et al. 1993)

CN

Test suite optimisation of our previous tool in Mongiovì et al. (2019), designed to minimise the number of test cases

ILP

ILP-based test suite optimisation as described in the first part of the method section

ILP+CFG

ILP-based test suite optimisation integrated with the CFG analysis, except the back edges removal

REDUNET

Our complete tool, i.e. ILP + CFG + back edges removal