direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationen

Pairwise test set calculation using k-partite graphs
Zitatschlüssel saleckerG2010
Autor Elke Salecker and Sabine Glesner
Jahr 2010
ISBN 978-1-4244-8630-4
ISSN 1063-6773
DOI 10.1109/ICSM.2010.5609653
Journal IEEE International Conference on Software Maintenance (ICSM2010)
Monat Sep
Herausgeber Radu Marinescu and Michele Lanza and Andrian Marcus
Verlag IEEE
Zusammenfassung Many software faults are triggered by unusual combinations of input values and can be detected using pairwise test sets that cover each pair of input values. The generation of pairwise test sets with a minimal size is an NP-complete problem which implies that many algorithms are either expensive or based on a random process. In this paper we present a deterministic algorithm that exploits our observation that the pairwise testing problem can be modeled as a k-partite graph problem. We calculate the test set using well investigated graph algorithms that take advantage of properties of k-partite graphs. We present evaluation results that prove the applicability of our algorithm and discuss possible improvement of our approach.
Link zur Originalpublikation [1] Download Bibtex Eintrag [2]
------ Links: ------

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

Copyright TU Berlin 2008