Latent Mutants: A large-scale study on the Interplay between mutation testing and software evolution

• URL: http://arxiv.org/abs/2501.01873v1
• Date: Fri, 03 Jan 2025 15:44:38 GMT
• Title: Latent Mutants: A large-scale study on the Interplay between mutation testing and software evolution
• Authors: Jeongju Sohn, Ezekiel Soremekun, Michail Papadakis,
• Abstract summary: We study the characteristics of what we call latent mutants, i.e., the mutants that are live in one version and killed in later revisions. We examine 131,308 mutants generated by Pitest on 13 open-source projects.
• Score: 2.1984302611206537
• License:
• Abstract: In this paper we apply mutation testing in an in-time fashion, i.e., across multiple project releases. Thus, we investigate how the mutants of the current version behave in the future versions of the programs. We study the characteristics of what we call latent mutants, i.e., the mutants that are live in one version and killed in later revisions, and explore whether they are predictable with these properties. We examine 131,308 mutants generated by Pitest on 13 open-source projects. Around 11.2% of these mutants are live, and 3.5% of them are latent, manifesting in 104 days on average. Using the mutation operators and change-related features we successfully demonstrate that these latent mutants are identifiable, predicting them with an accuracy of 86% and a balanced accuracy of 67% using a simple random forest classifier.

Related papers

• A Simple yet Effective DDG Predictor is An Unsupervised Antibody Optimizer and Explainer [53.85265022754878]
  We propose a lightweight DDG predictor (Light-DDG) for fast mutation screening. We also release a large-scale dataset containing millions of mutation data for pre-training Light-DDG. For the target antibody, we propose a novel Mutation Explainer to learn mutation preferences.
  arXiv  Detail & Related papers  (2025-02-10T09:26:57Z)
• METFORD -- Mutation tEsTing Framework fOR anDroid [0.0]
  This research aims to contribute to reducing Android mutation testing costs. It implements mutation testing operators according to mutant schemata. Additional mutation operators can be implemented in JavaScript and easily integrated into the framework.
  arXiv  Detail & Related papers  (2025-01-06T09:36:57Z)
• Leveraging Propagated Infection to Crossfire Mutants [4.229296050697151]
  When tests are insufficient, each surviving mutant provides an opportunity to improve the test suite. Many surviving mutants are detectable by simply augmenting existing tests with additional assertions. We build upon prior research that identifies crossfiring'' opportunities -- tests that coincidentally kill multiple mutants.
  arXiv  Detail & Related papers  (2024-11-14T23:31:26Z)
• Words Worth a Thousand Pictures: Measuring and Understanding Perceptual Variability in Text-to-Image Generation [58.77994391566484]
  We propose W1KP, a human-calibrated measure of variability in a set of images. Our best perceptual distance outperforms nine baselines by up to 18 points in accuracy. We analyze 56 linguistic features of real prompts, finding that the prompt's length, CLIP embedding norm, concreteness, and word senses influence variability most.
  arXiv  Detail & Related papers  (2024-06-12T17:59:27Z)
• An Empirical Evaluation of Manually Created Equivalent Mutants [54.02049952279685]
  Less than 10 % of manually created mutants are equivalent. Surprisingly, our findings indicate that a significant portion of developers struggle to accurately identify equivalent mutants.
  arXiv  Detail & Related papers  (2024-04-14T13:04:10Z)
• MuRS: Mutant Ranking and Suppression using Identifier Templates [4.9205581820379765]
  Google's mutation testing service integrates diff-based mutation testing into the code review process. Google's mutation testing service implements a number of suppression rules, which target not-useful mutants. This paper proposes and evaluates MuRS, an automated approach that groups mutants by patterns in the source code under test.
  arXiv  Detail & Related papers  (2023-06-15T13:43:52Z)
• rfPhen2Gen: A machine learning based association study of brain imaging phenotypes to genotypes [71.1144397510333]
  We learned machine learning models to predict SNPs using 56 brain imaging QTs. SNPs within the known Alzheimer disease (AD) risk gene APOE had lowest RMSE for lasso and random forest. Random forests identified additional SNPs that were not prioritized by the linear models but are known to be associated with brain-related disorders.
  arXiv  Detail & Related papers  (2022-03-31T20:15:22Z)
• MutFormer: A context-dependent transformer-based model to predict pathogenic missense mutations [5.153619184788929]
  missense mutations account for approximately half of the known variants responsible for human inherited diseases. Recent advances in deep learning show that transformer models are particularly powerful at modeling sequences. We introduce MutFormer, a transformer-based model for prediction of pathogenic missense mutations.
  arXiv  Detail & Related papers  (2021-10-27T20:17:35Z)
• Neuromorphic adaptive spiking CPG towards bio-inspired locomotion of legged robots [58.720142291102135]
  Spiking Central Pattern Generator generates different locomotion patterns driven by an external stimulus. The locomotion of the end robotic platform (any-legged robot) can be adapted to the terrain by using any sensor as input.
  arXiv  Detail & Related papers  (2021-01-24T12:44:38Z)
• Tracking disease outbreaks from sparse data with Bayesian inference [55.82986443159948]
  The COVID-19 pandemic provides new motivation for estimating the empirical rate of transmission during an outbreak. Standard methods struggle to accommodate the partial observability and sparse data common at finer scales. We propose a Bayesian framework which accommodates partial observability in a principled manner.
  arXiv  Detail & Related papers  (2020-09-12T20:37:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.