direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationen

Calculating Prioritized Interaction Test Sets with Constraints using Binary Decision Diagrams
Zitatschlüssel saleckerRG2011
Autor Elke Salecker and Robert Reicherdt and Sabine Glesner
Jahr 2011
Journal 1st Int’l Workshop on Variability-intensive Systems Testing, Validation & Verification (ICST-VAST2011)
Verlag IEEE
Zusammenfassung Combinatorial interaction testing has become an established technique to systematically determine test sets for highly-configurable software systems. The generation of minimal test sets that fulfill the demanded coverage criteria is an NP-complete problem. Constraint handling and integrated test case prioritization, features necessary for practical use, further complicate the problem. We present a novel algorithm that exploits our observation that the combinatorial interaction testing problem with constraints can be modelled as a single propositional logic formula. Our test set calculation algorithm uses binary decision diagrams as efficient data structure for this formula. The algorithm supports constraints and prioritization. Our evaluation results prove its cost effectiveness. For many benchmark problems the algorithm calculates the best results compared to other greedy approaches.
Link zur Originalpublikation [1] Download Bibtex Eintrag [2]
------ Links: ------

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008