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
Optimization of Combinatorial Testing by Incremental SAT Solving
National Institute of Advanced Industrial Science and Technology (AIST), Japan.ORCID iD: 0000-0002-3656-1614
Show others and affiliations
2015 (English)In: 2015 IEEE 8th International Conference on Software Testing, Verification and Validation, ICST 2015 - Proceedings, Institute of Electrical and Electronics Engineers (IEEE), 2015, 1-10 p., 7102599Conference paper (Refereed)
Abstract [en]

Combinatorial testing aims at reducing the cost of software and system testing by reducing the number of test cases to be executed. We propose an approach for combinatorial testing that generates a set of test cases that is as small as possible, using incremental SAT solving. We present several search-space pruning techniques that further improve our approach. Experiments show a significant improvement of our approach over other SAT-based approaches, and considerable reduction of the number of test cases over other combinatorial testing tools.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2015. 1-10 p., 7102599
Series
IEEE International Conference on Software Testing Verification and Validation Workshops, ISSN 2159-4848
Keyword [en]
Verification, Combinatorial testing, SAT-based, SAT-solving, Search space pruning, System testing, Test case
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-199108DOI: 10.1109/ICST.2015.7102599ISI: 000380913300021ScopusID: 2-s2.0-84935047777ISBN: 978-147997125-1 (print)OAI: oai:DiVA.org:kth-199108DiVA: diva2:1060483
Conference
8th IEEE International Conference on Software Testing, Verification and Validation, ICST 2015, Graz, Austria, 13 April 2015 through 17 April 2015
Note

QC 20170117

Available from: 2016-12-28 Created: 2016-12-28 Last updated: 2017-01-17Bibliographically approved

Open Access in DiVA

fulltext(852 kB)8 downloads
File information
File name FULLTEXT01.pdfFile size 852 kBChecksum SHA-512
85c7978b738ace144b98a707befc4a5a4f9a045202591ad399a53708689b38096bbc963cda614255a2bf4a042cadd5c96f27d3265fba41ab87b7ac50c1610e8c
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Artho, Cyrille
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 8 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

Altmetric score

Total: 3 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