A practical guide for using statistical tests to assess randomized algorithms in software engineering

A Arcuri, L Briand - Proceedings of the 33rd international conference on …, 2011 - dl.acm.org
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 …

A hitchhiker's guide to statistical tests for assessing randomized algorithms in software engineering

A Arcuri, L Briand - Software Testing, Verification and Reliability, 2014 - Wiley Online Library
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 …

A comparison of 10 sampling algorithms for configurable systems

F Medeiros, C Kästner, M Ribeiro, R Gheyi… - Proceedings of the 38th …, 2016 - dl.acm.org
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 …

Evaluating improvements to a meta-heuristic search for constrained interaction testing

BJ Garvin, MB Cohen, MB Dwyer - Empirical Software Engineering, 2011 - Springer
Combinatorial interaction testing (CIT) is a cost-effective sampling technique for discovering
interaction faults in highly-configurable systems. Constrained CIT extends the technique to …

Learning combinatorial interaction test generation strategies using hyperheuristic search

Y Jia, MB Cohen, M Harman… - 2015 IEEE/ACM 37th IEEE …, 2015 - ieeexplore.ieee.org
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 …

Multi-objective test case prioritization in highly configurable systems: A case study

JA Parejo, AB Sánchez, S Segura… - Journal of Systems and …, 2016 - Elsevier
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 …

Application of combinatorial testing to quantum programs

X Wang, P Arcaini, T Yue, S Ali - 2021 IEEE 21st International …, 2021 - ieeexplore.ieee.org
The capability of Quantum Computing (QC) in solving complex problems has been
increasingly recognized. However, similar to classical computing, to fully exploit QC's …

An efficient algorithm for constraint handling in combinatorial test generation

L Yu, Y Lei, M Nourozborazjany… - 2013 IEEE Sixth …, 2013 - ieeexplore.ieee.org
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 …

Repairing GUI test suites using a genetic algorithm

S Huang, MB Cohen, AM Memon - 2010 Third international …, 2010 - ieeexplore.ieee.org
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 …

Constrained interaction testing: A systematic literature study

BS Ahmed, KZ Zamli, W Afzal, M Bures - IEEE Access, 2017 - ieeexplore.ieee.org
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 …