Generalized Mutant Subsumption

Samia Al Blwi, Imen Marsit, Besma Khaireddine, Amani Ayad, JiMeng Loh, Ali Mili

2022

Abstract

Mutant Subsumption is an ordering relation between the mutants of a base program, which ranks mutants according to inclusion relationships between their differentiator sets. The differentiator set of a mutant with respect to a base program is the set of inputs for which execution of the base program and the mutant produce different outcomes. In this paper we propose to refine the definition of mutant subsumption by pondering, in turn: what do we consider to be the outcome of a program’s execution? under what condition do we consider that two outcomes are comparable? and under what condition do we consider that two comparable outcomes are identical? We find that the way we answer these questions determines what it means to kill a mutant, how subsumption is defined, how mutants are ordered by subsumption, and what set of mutants is minimal.

Paper Citation

in Harvard Style

Al Blwi S., Marsit I., Khaireddine B., Ayad A., Loh J. and Mili A. (2022). Generalized Mutant Subsumption. In Proceedings of the 17th International Conference on Software Technologies - Volume 1: ICSOFT, ISBN 978-989-758-588-3, pages 46-56. DOI: 10.5220/0011166700003266

in Bibtex Style

@conference{icsoft22,
author={Samia Al Blwi and Imen Marsit and Besma Khaireddine and Amani Ayad and JiMeng Loh and Ali Mili},
title={Generalized Mutant Subsumption},
booktitle={Proceedings of the 17th International Conference on Software Technologies - Volume 1: ICSOFT,},
year={2022},
pages={46-56},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0011166700003266},
isbn={978-989-758-588-3},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 17th International Conference on Software Technologies - Volume 1: ICSOFT,
TI - Generalized Mutant Subsumption
SN - 978-989-758-588-3
AU - Al Blwi S.
AU - Marsit I.
AU - Khaireddine B.
AU - Ayad A.
AU - Loh J.
AU - Mili A.
PY - 2022
SP - 46
EP - 56
DO - 10.5220/0011166700003266