<abstract xmlns="http://www.w3.org/1999/xhtml"><italic>Background</italic>: Mutation testing is a widely explored technique used to evaluate the quality of software tests, but little attention has been given to its mathematical foundations.<italic>Aim</italic>: We provide a formal description of the core concepts in mutation testing, relations between them and conclusions that can be drawn from the presented model.<italic>Method</italic>: We introduce concepts of mutant space and patch space, and refer to patch merging procedure from the patch theory. We explicitly present constraints, such as location-dependence, that affect mutation operators. We also present a way to use introduced formalism with traditional operators proposed in other papers.<italic>Results</italic>: The proposed formalism allows to describe interactions between separate mutations using well-known abstract algebra notation.<italic>Conclusion</italic>: The presented formalism may substantially decrease the number of tested weak mutants and increase the number of valuable ones, while giving tools to partially address the problem of equivalent mutants, particularly for higher-order mutation testing. However, additional empirical evaluation is still needed.</abstract>

Background: Mutation testing is a widely explored technique used to evaluate the quality of software tests, but little attention has been given to its mathematical foundations.Aim: We provide a formal description of the core concepts in mutation testing, relations between them and conclusions that can be drawn from the presented model.Method: We introduce concepts of mutant space and patch space, and refer to patch merging procedure from the patch theory. We explicitly present constraints, such as location-dependence, that affect mutation operators. We also present a way to use introduced formalism with traditional operators proposed in other papers.Results: The proposed formalism allows to describe interactions between separate mutations using well-known abstract algebra notation.Conclusion: The presented formalism may substantially decrease the number of tested weak mutants and increase the number of valuable ones, while giving tools to partially address the problem of equivalent mutants, particularly for higher-order mutation testing. However, additional empirical evaluation is still needed.

Mutants as Patches: Towards a formal approach to Mutation Testing

Faculty of Computer Science and Management

Wroclaw University of Science and Technology

Foundations of Computing and Decision Sciences

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"Mutants as Patches: Towards a formal approach to Mutation Testing"}

Background: Mutation testing is a widely explored technique used to evaluate the quality of software tests, but little attention has been given to its...

Mutants as Patches: Towards a formal approach to Mutation Testing

Pubblicato online: 25 nov 2019

Pagine: 379 - 405

Ricevuto: 17 gen 2019

Accettato: 25 ott 2019

DOI: https://doi.org/10.2478/fcds-2019-0019

Parole chiave
mutation testing, fault-based testing, patches, equivalent mutants

© 2019 Tomasz Lewowski et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Mutants as Patches: Towards a formal approach to Mutation Testing

Pubblicato online: 25 nov 2019

Pagine: 379 - 405

Ricevuto: 17 gen 2019

Accettato: 25 ott 2019

DOI: https://doi.org/10.2478/fcds-2019-0019

Parole chiavemutation testing, fault-based testing, patches, equivalent mutants

© 2019 Tomasz Lewowski et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Parole chiave
mutation testing, fault-based testing, patches, equivalent mutants