A practical guide for using statistical tests to assess randomized algorithms in software engineering
Randomized algorithms have been used to successfully address many different types of
software engineering problems. This type of algorithms employ a degree of randomness as …
software engineering problems. This type of algorithms employ a degree of randomness as …
A hitchhiker's guide to statistical tests for assessing randomized algorithms in software engineering
Randomized algorithms are widely used to address many types of software engineering
problems, especially in the area of software verification and validation with a strong …
problems, especially in the area of software verification and validation with a strong …
A comparison of 10 sampling algorithms for configurable systems
Almost every software system provides configuration options to tailor the system to the target
platform and application scenario. Often, this configurability renders the analysis of every …
platform and application scenario. Often, this configurability renders the analysis of every …
Evaluating improvements to a meta-heuristic search for constrained interaction testing
Combinatorial interaction testing (CIT) is a cost-effective sampling technique for discovering
interaction faults in highly-configurable systems. Constrained CIT extends the technique to …
interaction faults in highly-configurable systems. Constrained CIT extends the technique to …
Learning combinatorial interaction test generation strategies using hyperheuristic search
The surge of search based software engineering research has been hampered by the need
to develop customized search algorithms for different classes of the same problem. For …
to develop customized search algorithms for different classes of the same problem. For …
Multi-objective test case prioritization in highly configurable systems: A case study
Test case prioritization schedules test cases for execution in an order that attempts to
accelerate the detection of faults. The order of test cases is determined by prioritization …
accelerate the detection of faults. The order of test cases is determined by prioritization …
Application of combinatorial testing to quantum programs
The capability of Quantum Computing (QC) in solving complex problems has been
increasingly recognized. However, similar to classical computing, to fully exploit QC's …
increasingly recognized. However, similar to classical computing, to fully exploit QC's …
An efficient algorithm for constraint handling in combinatorial test generation
Combinatorial testing has been shown to be a very effective testing strategy. An important
problem in combinatorial testing is dealing with constraints, ie, restrictions that must be …
problem in combinatorial testing is dealing with constraints, ie, restrictions that must be …
Repairing GUI test suites using a genetic algorithm
Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on
deriving graph models that approximate all possible sequences of events that may be …
deriving graph models that approximate all possible sequences of events that may be …
Constrained interaction testing: A systematic literature study
Interaction testing can be used to effectively detect faults that are otherwise difficult to find by
other testing techniques. However, in practice, the input configurations of software systems …
other testing techniques. However, in practice, the input configurations of software systems …