Högskolan i Skövde

his.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
On Strong Mutation and Subsuming Mutants
Högskolan i Skövde, Institutionen för informationsteknologi. Högskolan i Skövde, Forskningscentrum för Informationsteknologi. (Distribuerade realtidssystem, Distributed Real-Time Systems (DRTS))ORCID-id: 0000-0002-1039-5830
Högskolan i Skövde, Institutionen för informationsteknologi. Högskolan i Skövde, Forskningscentrum för Informationsteknologi. (Distribuerade realtidssystem, Distributed Real-Time Systems (DRTS))
2016 (Engelska)Ingår i: Proceedings: 2016 IEEE International Conference on Software Testing, Verification and Validation Workshops, IEEE Computer Society, 2016, s. 112-121Konferensbidrag, Publicerat paper (Refereegranskat)
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.

Ort, förlag, år, upplaga, sidor
IEEE Computer Society, 2016. s. 112-121
Nyckelord [en]
mutation testing, redundant mutant, strong mutation, subsumption
Nationell ämneskategori
Datavetenskap (datalogi)
Forskningsämne
Distribuerade realtidssystem (DRTS)
Identifikatorer
URN: urn:nbn:se:his:diva-12766DOI: 10.1109/ICSTW.2016.28ISI: 000382490200017Scopus ID: 2-s2.0-84992184216ISBN: 978-1-5090-1826-0 (tryckt)OAI: oai:DiVA.org:his-12766DiVA, id: diva2:951610
Konferens
IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), 11-15 April 2016, Chicago, IL, USA
Projekt
TOCSYC
Forskningsfinansiär
KK-stiftelsen, 20130085Tillgänglig från: 2016-08-09 Skapad: 2016-08-09 Senast uppdaterad: 2019-01-22Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Lindström, BirgittaMárki, András

Sök vidare i DiVA

Av författaren/redaktören
Lindström, BirgittaMárki, András
Av organisationen
Institutionen för informationsteknologiForskningscentrum för Informationsteknologi
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 904 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf