Högskolan i Skövde

his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On Strong Mutation and Subsuming Mutants
University of Skövde, School of Informatics. University of Skövde, The Informatics Research Centre. (Distribuerade realtidssystem, Distributed Real-Time Systems (DRTS))ORCID iD: 0000-0002-1039-5830
University of Skövde, School of Informatics. University of Skövde, The Informatics Research Centre. (Distribuerade realtidssystem, Distributed Real-Time Systems (DRTS))
2016 (English)In: Proceedings: 2016 IEEE International Conference on Software Testing, Verification and Validation Workshops, IEEE Computer Society, 2016, p. 112-121Conference paper, Published paper (Refereed)
Abstract [en]

Mutation analysis is a powerful technique for software testing but it is also known to be computationally expensive.The main reason for the high computational cost is that many of themutants are redundant and thus, do not contribute to the quality of the test suite. One of the most promising approaches toavoid producing redundant mutants is to identify subsumption relations among mutants, preferably before these are generated.Such relations have for example, been identified at an operator level for mutants created by the ROR operator. This reduced set of non-redundant mutants hasbeen used in several recent studies and is also the default option in at least one mutation testing tool that supports strong mutation. This raises questions on whether the identified subsumption relations between the mutants hold in a context ofstrong mutation or variants of weak mutation that require some limited error propagation (firm mutation).

We have conducted an experimental study to investigate the subsumption relations in the context of strong or firm mutation.We observed that it is possible to create a test suite that is 100\% adequate for the reduced set of mutants while not being 100\% adequate for the complete set. This shows that the subsumption relations do not hold for strong or firm mutation. We provide several examples on this behavior and discuss the root causes. Our findings are important since strong and firm mutation both are frequently used to evaluate test suites and testing criteria. The choice of whether to use a reduced set of mutants or an entire set should however, not be made without consideration of the context in which they are used (i.e., strong, firm or weak mutation) since the subsumption relations between ROR mutants do not hold for strong or firm mutation.Just as redundant mutants can give an overestimation of the mutation score for a test suite, using the reduced set of mutantscan give an underestimation if used together with strong or firm mutation. Results reported from such studies should therefore, be accompanied by information on whether the reduced or complete set of mutants was used and if the researchers used strong, firm or weak mutation.

Place, publisher, year, edition, pages
IEEE Computer Society, 2016. p. 112-121
Keywords [en]
mutation testing, redundant mutant, strong mutation, subsumption
National Category
Computer Sciences
Research subject
Distributed Real-Time Systems
Identifiers
URN: urn:nbn:se:his:diva-12766DOI: 10.1109/ICSTW.2016.28ISI: 000382490200017Scopus ID: 2-s2.0-84992184216ISBN: 978-1-5090-1826-0 (print)OAI: oai:DiVA.org:his-12766DiVA, id: diva2:951610
Conference
IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), 11-15 April 2016, Chicago, IL, USA
Projects
TOCSYC
Funder
Knowledge Foundation, 20130085Available from: 2016-08-09 Created: 2016-08-09 Last updated: 2019-01-22Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Lindström, BirgittaMárki, András

Search in DiVA

By author/editor
Lindström, BirgittaMárki, András
By organisation
School of InformaticsThe Informatics Research Centre
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 1112 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf