Approximate Transformations as Mutation Operators
نویسندگان
چکیده
Mutation testing is a well-established approach for evaluating test-suite quality by modifying code using syntaxchanging (and potentially semantics-changing) transformations, called mutation operators. This paper proposes approximate transformations as new mutation operators that can give novel insights about the code and tests. Approximate transformations are semantics-changing transformations used in the emerging area of approximate computing, but so far they were not evaluated for mutation testing. We found that approximate transformations can be effective mutation operators. We compared three approximate transformations with a set of conventional mutation operators from the literature, on nine open-source Java subjects. The results showed that approximate transformations change program behavior differently fromconventional mutation operators. Our analysis uncovered code patterns in which approximate mutants survivedand showed the practical value of approximate transformations for both understanding code amenable to approximations and discovering bad tests. We submitted 11 pull requests to fix bad tests. Seven have already been integrated by the developers.
منابع مشابه
Approximate diagonalization of variable-coefficient differential operators through similarity transformations
Approaches to approximate diagonalization of variable-coefficient differential operators using similarity transformations are presented. These diagonalization techniques are inspired by the interpretation of the Uncertainty Principle by Fefferman, known as the SAK Principle, that suggests the location of eigenfunctions of self-adjoint differential operators in phase space. The similarity transf...
متن کاملSTRUCTURAL OPTIMIZATION USING A MUTATION-BASED GENETIC ALGORITHM
The present study is an attempt to propose a mutation-based real-coded genetic algorithm (MBRCGA) for sizing and layout optimization of planar and spatial truss structures. The Gaussian mutation operator is used to create the reproduction operators. An adaptive tournament selection mechanism in combination with adaptive Gaussian mutation operators are proposed to achieve an effective search in ...
متن کاملA Novel Method for Generating Approximate Wavefunctions
Abstract Molecular Hamiltonians are constituted by momentum operators (e.g. kinetic energy and interaction with electro-magnetic radiation), local potential operators (e.g. electron-electron coulomb, electron-nucleus and electron-external field interactions) and spin operators. In general the effect of transformations that generate states from a reference state is to destroy this form. Here it ...
متن کاملTowards Approximate Model Transformations
As the size and complexity of models grow, there is a need to count on novel mechanisms and tools for transforming them. This is required, e.g., when model transformations need to provide target models without having access to the complete source models or in really short time—as it happens, e.g., with streaming models—or with very large models for which the transformation algorithms become too...
متن کاملThe approximate solutions of Fredholm integral equations on Cantor sets within local fractional operators
In this paper, we apply the local fractional Adomian decomposition and variational iteration methods to obtain the analytic approximate solutions of Fredholm integral equations of the second kind within local fractional derivative operators. The iteration procedure is based on local fractional derivative. The obtained results reveal that the proposed methods are very efficient and simple tools ...
متن کامل