Employment of Multiple Algorithms for Optimal Path-based Test Selection Strategy
Miroslav Bures, Bestoun S. Ahmed

TL;DR
This paper introduces a path-based strategy that combines multiple algorithms to generate and select optimal test sequences for software testing, considering various coverage and prioritization criteria.
Contribution
It proposes a novel multi-algorithm approach for optimal test selection that adapts to different problem instances and criteria, improving test effectiveness.
Findings
Different algorithms yield optimal results for different models.
Test set optimality varies with coverage level and prioritization.
The strategy is validated through experiments on 50 system models.
Abstract
Executing various sequences of system functions in a system under test represents one of the primary techniques in software testing. The natural way to create effective, consistent and efficient test sequences is to model the system under test and employ an algorithm to generate the tests that satisfy a defined test coverage criterion. Several criteria of test set optimality can be defined. In addition, to optimize the test set from an economic viewpoint, the priorities of the various parts of the system model under test must be defined. Using this prioritization, the test cases exercise the high priority parts of the system under test more intensely than those with low priority. Evidence from the literature and our observations confirm that finding a universal algorithm that produces an optimal test set for all test coverage and test set optimality criteria is a challenging task.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
