Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Priority Integration for Weighted Combinatorial Testing
Show others and affiliations
2015 (English)In: Proc. 39th IEEE Annual Computer Software and Applications Conf., COMPSAC 2015, IEEE conference proceedings, 2015, Vol. 2, p. 242-247Conference paper, Published paper (Refereed)
Abstract [en]

Priorities (weights) for parameter values can improve the effectiveness of combinatorial testing. Previous approaches have employed weights to derive high-priority test cases either earlier or more frequently. Our approach integrates these order-focused and frequency-focused prioritizations. We show that our priority integration realizes a small test suite providing high-priority test cases early and frequently in a good balance. We also propose two algorithms that apply our priority integration to existing combinatorial test generation algorithms. Experimental results using numerous test models show that our approach improves the existing approaches w.r.t. Order-focused and frequency-focused metrics, while overheads in the size and generation time of test suites are small.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2015. Vol. 2, p. 242-247
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-199105DOI: 10.1109/COMPSAC.2015.113ISI: 000380584300037Scopus ID: 2-s2.0-84962137667OAI: oai:DiVA.org:kth-199105DiVA, id: diva2:1060486
Conference
39th IEEE Annual Computer Software and Applications Conf., COMPSAC 2015
Note

QC 20170109

Available from: 2016-12-28 Created: 2016-12-28 Last updated: 2018-01-13Bibliographically approved

Open Access in DiVA

fulltext(599 kB)15 downloads
File information
File name FULLTEXT01.pdfFile size 599 kBChecksum SHA-512
e6f7078749182a68aa0485a2b48ec9912bd6ff4692fcee7ffed456af05245960b92ce534753e93a67b027551555edbcf36a788f34e21d04cd4bb4377567037ef
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopushttp://ieeexplore.ieee.org/document/7273624/

Search in DiVA

By author/editor
Artho, Cyrille
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 15 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

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

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