his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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 the theory of subsuming logic‐based mutants
University of Skövde, School of Informatics. University of Skövde, The Informatics Research Centre. (Distribuerade realtidssystem (DRTS), Distributed Real-Time Systems)ORCID iD: 0000-0002-1039-5830
University of Skövde, School of Informatics. University of Skövde, The Informatics Research Centre. (Distribuerade realtidssystem (DRTS), Distributed Real-Time Systems)
2019 (English)In: Software testing, verification & reliability, ISSN 0960-0833, E-ISSN 1099-1689, Vol. 29, no 1-2 Special Issue: SI, p. 1-23, article id e1667Article in journal (Refereed) Published
Abstract [en]

Redundant mutants might cause problems when benchmarking since testing techniques can get high scores without detecting any nonredundant mutants. However, removing nonredundant mutants might cause similar problems. Subsumed mutants are per definition also redundant since no additional tests are required to detect them once all other mutants are detected. We focus on relational operator replacement (ROR) and conditional operator replacement mutants. Subsumption relations between ROR mutants are defined by fault hierarchies. The fault hierarchies are proven for weak mutation but have since they were published been used with strong mutation. We prove that ROR fault hierarchies do not hold for strong mutation and show why. We also show that the probability for a random test to experience the problem can be more than 30% and that 50% of the mutants might be affected in a real software system. Finally, we show that there is a similar problem with the theory on sufficient conditional operator replacement.

Place, publisher, year, edition, pages
John Wiley & Sons, 2019. Vol. 29, no 1-2 Special Issue: SI, p. 1-23, article id e1667
Keywords [en]
error propagation, mutant subsumption, mutation testing, redundant mutants
National Category
Computer Sciences
Research subject
Distributed Real-Time Systems
Identifiers
URN: urn:nbn:se:his:diva-15090DOI: 10.1002/stvr.1667ISI: 000458911000003Scopus ID: 2-s2.0-85045856317OAI: oai:DiVA.org:his-15090DiVA, id: diva2:1199617
Projects
TOCSYC
Funder
Knowledge Foundation, 20130085Available from: 2018-04-21 Created: 2018-04-21 Last updated: 2019-03-05Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

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
In the same journal
Software testing, verification & reliability
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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