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
Using Mutant Stubbornness to Create Minimal and Prioritized Test Sets
University of Skövde, Sweden.
University of Skövde, Sweden.
George Mason University, USA.
University of Skövde, Sweden.
Show others and affiliations
2018 (English)In: 2018 IEEE International Conference on Software Quality, Reliability and Security,  QRS 2018, 2018, p. 446-457Conference paper, Published paper (Refereed)
Abstract [en]

In testing, engineers want to run the most useful tests early (prioritization). When tests are run hundreds or thousands of times, minimizing a test set can result in significant savings (minimization). This paper proposes a new analysis technique to address both the minimal test set and the test case prioritization problems. This paper precisely defines the concept of mutant stubbornness, which is the basis for our analysis technique. We empirically compare our technique with other test case minimization and prioritization techniques in terms of the size of the minimized test sets and how quickly mutants are killed. We used seven C language subjects from the Siemens Repository, specifically the test sets and the killing matrices from a previous study. We used 30 different orders for each set and ran every technique 100 times over each set. Results show that our analysis technique performed significantly better than prior techniques for creating minimal test sets and was able to establish new bounds for all cases. Also, our analysis technique killed mutants as fast or faster than prior techniques. These results indicate that our mutant stubbornness technique constructs test sets that are both minimal in size, and prioritized effectively, as well or better than other techniques.

Place, publisher, year, edition, pages
2018. p. 446-457
Keywords [en]
Test Case Minimization, Minimal Sets, Test Case Prioritization, Mutant Stubbornness
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-35178DOI: 10.1109/QRS.2018.00058Scopus ID: 2-s2.0-85052313827ISBN: 978-1-5386-7757-5 (print)OAI: oai:DiVA.org:ri-35178DiVA, id: diva2:1247507
Conference
2018 IEEE International Conference on Software Quality, Reliability and Security, QRS 2018
Available from: 2018-09-12 Created: 2018-09-12 Last updated: 2019-03-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopushttps://ieeexplore.ieee.org/document/8424996/

Authority records BETA

Potena, Pasqualina

Search in DiVA

By author/editor
Potena, PasqualinaBohlin, Markus
By organisation
SICSRISE - Research Institutes of Sweden
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 9 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
v. 2.35.7