DC FieldValueLanguage
dc.contributor.advisorSimos, Dimitrios-
dc.contributor.authorKleine, Kristoffer-
dc.date.accessioned2020-06-29T11:35:08Z-
dc.date.issued2018-
dc.date.submitted2018-04-
dc.identifier.urihttps://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-108278-
dc.identifier.urihttp://hdl.handle.net/20.500.12708/6176-
dc.description.abstractCombinatorial Testing (CT) is an effective testing strategy which has seen increased adoption in the field of software testing. As a black-box testing technique it concerns itself with generating input test cases able to provide mathematical input-space coverage guarantees while keeping the number of test cases low. Generating optimal combinatorial test sets is believed to be a hard optimization problem which has spurred the development of several greedy algorithms which trade-off optimality for speed. One of the most popular representatives is the In-Parameter-Order family of algorithms. This class of algorithms has seen a wide adoption in including software, hardware and security testing as they are able to construct test sets for most instances occurring in practice. In this thesis, an efficient design of the In-Parameter-Order algorithms is presented which drastically reduces the time and required memory to compute combinatorial test sets. The improved theoretical design is implemented in a prototype and benchmarked against the state of the art implementation. Furthermore, the algorithms are made available in a general purpose test generation tool developed for this thesis which is open and free to use by anyone. The thesis also studies the impact of tie-breaking, parameter ordering and tuple enumeration order on the resulting test sets. An extensive experimental study shows that different tie-breakers have no significant impact on average and that ordering parameters in order of descending domain size can lead to drastically smaller test sets.en
dc.formatxvii, 78 Seiten-
dc.languageEnglish-
dc.language.isoen-
dc.subjectAlgorithmsde
dc.subjectToolsde
dc.subjectCombinatorial Testingde
dc.subjectSoftware Engineeringde
dc.subjectOptimizationde
dc.subjectAlgorithmsen
dc.subjectToolsen
dc.subjectCombinatorial Testingen
dc.subjectSoftware Engineeringen
dc.subjectOptimizationen
dc.titleEfficient algorithms and tools for practical combinatorial testingen
dc.typeThesisen
dc.typeHochschulschriftde
dc.publisher.placeWien-
tuw.thesisinformationTechnische Universität Wien-
dc.contributor.assistantWeippl, Edgar-
tuw.publication.orgunitE194 - Institut für Information Systems Engineering-
dc.type.qualificationlevelDiploma-
dc.identifier.libraryidAC15033907-
dc.description.numberOfPages78-
dc.identifier.urnurn:nbn:at:at-ubtuw:1-108278-
dc.thesistypeDiplomarbeitde
dc.thesistypeDiploma Thesisen
item.grantfulltextopen-
item.languageiso639-1en-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextwith Fulltext-
item.cerifentitytypePublications-
item.cerifentitytypePublications-
item.openairetypeThesis-
item.openairetypeHochschulschrift-
Appears in Collections:Thesis

Files in this item:

Show simple item record

Page view(s)

19
checked on Apr 20, 2021

Download(s)

59
checked on Apr 20, 2021

Google ScholarTM

Check


Items in reposiTUm are protected by copyright, with all rights reserved, unless otherwise indicated.