Test Case Prioritization—ANT Algorithm With Faults Severity. (6th November 2020)

• Record Type: Journal Article
• Authors: Vescan, Andreea; Pintea, Camelia-M; Pop, Petrică C
• Is Part Of: Logic journal of the IGPL. Volume 30:Number 2(2022)
• Page Start: 277
• Page End: 288
• Publication Date: 2020-11-06
• Subjects: Regression testing -- security features -- faults severity -- prioritization -- ant algorithms -- optimization; Logic, Symbolic and mathematical -- Periodicals; 511.3
• DOI: 10.1093/jigpal/jzaa061
• Languages: English
• ISSNs: 1367-0751

Abstract

Abstract: Regression testing is applied whenever a code changes, ensuring that the modifications fixed the fault and no other faults are introduced. Due to a large number of test cases to be run, test case prioritization is one of the strategies that allows to run the test cases with the highest fault rate first. The aim of the paper is to present an optimized test case prioritization method inspired by ant colony optimization, test case prioritization–ANT . The criteria used by the optimization algorithm are the number of faults not covered yet by the selected test cases and the sum of severity of the faults. The cost, i.e. time execution, for test cases is considered in the computation of the pheromone deposited on the graph's edges. The average percentage of fault detected metric, as best selection criterion, is used to uncover maximum faults with the highest severity, and reducing the regression testing time. Several experiments are considered, detailed and discussed, comparing various algorithm parameter's alternatives. A benchmark project is also used to validate the proposed approach. The obtained results are encouraging, being a cornerstone for new perspectives to be considered.