Skip to content

Optimizing Search for Tests Relevant to Order-Dependent Flaky Tests

· 0 citations · 51 references

TL;DR

Three different types of search options are proposed to reduce the overall search time of iFixFlakies: split options that leverage hierarchical, code similarity, and historical information to better form the subsequences for further search, a pick option that prioritizes running a subsequence of tests based on its expected running time, and a run option that can skip running entire sequences of tests.

View source

Similar papers

Predictive Test Optimization Without Historical Failure Data

The novel method of co-evolution labeling for predictive test optimization is introduced, deriving test relevance from tests and code changing together in the version history, which nearly matches the failure detection capabilities of failure-based models, while being more resistant to label noise and requiring no test...

Maximilian Jungwirth, RaphaelN ̈ommer, Andreas Stahlbauer et al. · 0 citations
Book Open access Oct 2026

TDRepro: A Neurosymbolic Approach to Reproducing Timing-Dependent Flaky Test Failures

TDRepro is presented, an automated approach that leverages large-language models (LLMs) and program analysis to efficiently reproduce TD-test failures and achieves more reliable reproduction, with 55 tests reaching a failure reproduction rate of >99%, compared with 30 tests for FlakeRake.

Shanto Rahman, Talank Baral, August Shi et al. · 0 citations
Preprint Sep 2026

Evaluating the effectiveness of class-level LLM-generated test suites in Python

Reliable assessment of LLM-generated tests should treat executability as a gate and combine coverage with mutation testing and structural quality indicators, and in practice, model selection should precede prompt tuning.

Bilal Al-Ahmad, M. Harshvardhan, Khaled El-Fakih et al. · 0 citations
Open access Oct 2026

LLMutantKiller: Using Large Language Models to Generate Tests That Kill Mutants

The primary goal of mutation testing is to assess the quality of an application’s test suite. This is accomplished by introducing syntactic changes into a program and determining if any test failures occur for the resulting mutated program, commonly referred to as a mutant. If so, the mutant is said to be killed, confi...

Fari Khalili, Aidan Domondon, Harshit Garg et al. · 2 citations
#software testing Preprint Sep 2026

How effective are traditional test criteria at detecting bugs in large language models generated code?

An empirical study involving 5 Large Language Models and 4 benchmarks evaluates the effectiveness and efficiency of 3 widely used adequacy criteria: statement coverage, branch coverage, and mutation testing, finding that mutation testing only marginally outperforms traditional coverage criteria in both triggering and d...

Asma Hamidi, Michael Konstantinou, R. Degiovanni et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.