<div class="csl-bib-body">
<div class="csl-entry">Kleine, K. (2018). <i>Efficient algorithms and tools for practical combinatorial testing</i> [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.55567</div>
</div>
-
dc.identifier.uri
https://doi.org/10.34726/hss.2018.55567
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/6176
-
dc.description.abstract
Combinatorial 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.language
English
-
dc.language.iso
en
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
Algorithms
de
dc.subject
Tools
de
dc.subject
Combinatorial Testing
de
dc.subject
Software Engineering
de
dc.subject
Optimization
de
dc.subject
Algorithms
en
dc.subject
Tools
en
dc.subject
Combinatorial Testing
en
dc.subject
Software Engineering
en
dc.subject
Optimization
en
dc.title
Efficient algorithms and tools for practical combinatorial testing
en
dc.type
Thesis
en
dc.type
Hochschulschrift
de
dc.rights.license
In Copyright
en
dc.rights.license
Urheberrechtsschutz
de
dc.identifier.doi
10.34726/hss.2018.55567
-
dc.contributor.affiliation
TU Wien, Österreich
-
dc.rights.holder
Kristoffer Kleine
-
dc.publisher.place
Wien
-
tuw.version
vor
-
tuw.thesisinformation
Technische Universität Wien
-
dc.contributor.assistant
Weippl, Edgar
-
tuw.publication.orgunit
E194 - Institut für Information Systems Engineering
-
dc.type.qualificationlevel
Diploma
-
dc.identifier.libraryid
AC15033907
-
dc.description.numberOfPages
78
-
dc.identifier.urn
urn:nbn:at:at-ubtuw:1-108278
-
dc.thesistype
Diplomarbeit
de
dc.thesistype
Diploma Thesis
en
dc.rights.identifier
In Copyright
en
dc.rights.identifier
Urheberrechtsschutz
de
tuw.advisor.staffStatus
staff
-
tuw.assistant.staffStatus
staff
-
item.fulltext
with Fulltext
-
item.cerifentitytype
Publications
-
item.mimetype
application/pdf
-
item.openairecristype
http://purl.org/coar/resource_type/c_bdcc
-
item.languageiso639-1
en
-
item.openaccessfulltext
Open Access
-
item.openairetype
master thesis
-
item.grantfulltext
open
-
crisitem.author.dept
E194 - Institut für Information Systems Engineering