TU Darmstadt / ULB / TUbiblio

Efficient Reduction of Model-Based Generated Test Suites Through Test Case Pair Prioritization

Cichos, Harald ; Heinze, Thomas (2010)
Efficient Reduction of Model-Based Generated Test Suites Through Test Case Pair Prioritization.
International Workshop on Model-Driven Engineering, Verification and Validation (MoDeVVa 2010). Oslo, Norway (03.10. - 03.10.2010)
doi: 10.1109/MoDeVVa.2010.19
Konferenzveröffentlichung, Bibliographie

Dies ist die neueste Version dieses Eintrags.

Kurzbeschreibung (Abstract)

During the development and maintenance of software, test suites often reach a size that exceeds the costs allocated for test suite execution. In such a case, the test suite needs to be reduced. Many papers are dedicated to the problem of test suite reduction. Most of them consider the removal or merging of test cases. However, less attention has been paid to the identification of test case pairs, which are eminently suitable for merging. In this paper, we fill this gap by presenting a novel approach that helps identifying those test case pairs within a given set of systematically generated test cases which, when merged, have potential for high test suite reduction. As a result, test suites reduced by our approach are considerably smaller in size than those, whose pairs are selected randomly.

Typ des Eintrags: Konferenzveröffentlichung
Erschienen: 2010
Autor(en): Cichos, Harald ; Heinze, Thomas
Art des Eintrags: Bibliographie
Titel: Efficient Reduction of Model-Based Generated Test Suites Through Test Case Pair Prioritization
Sprache: Englisch
Publikationsjahr: 2010
Ort: Los Alamitos, Calif.
Verlag: IEEE Computer Society Press
Buchtitel: 2010 Workshop on Model-Driven Engineering, Verification, and Validation
Veranstaltungstitel: International Workshop on Model-Driven Engineering, Verification and Validation (MoDeVVa 2010)
Veranstaltungsort: Oslo, Norway
Veranstaltungsdatum: 03.10. - 03.10.2010
DOI: 10.1109/MoDeVVa.2010.19
Kurzbeschreibung (Abstract):

During the development and maintenance of software, test suites often reach a size that exceeds the costs allocated for test suite execution. In such a case, the test suite needs to be reduced. Many papers are dedicated to the problem of test suite reduction. Most of them consider the removal or merging of test cases. However, less attention has been paid to the identification of test case pairs, which are eminently suitable for merging. In this paper, we fill this gap by presenting a novel approach that helps identifying those test case pairs within a given set of systematically generated test cases which, when merged, have potential for high test suite reduction. As a result, test suites reduced by our approach are considerably smaller in size than those, whose pairs are selected randomly.

Zusätzliche Informationen:

best paper award

Fachbereich(e)/-gebiet(e): 18 Fachbereich Elektrotechnik und Informationstechnik
18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik > Echtzeitsysteme
18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik
20 Fachbereich Informatik
Hinterlegungsdatum: 22 Aug 2011 08:46
Letzte Änderung: 25 Jun 2024 13:04
PPN:
Export:
Suche nach Titel in: TUfind oder in Google

Verfügbare Versionen dieses Eintrags

Frage zum Eintrag Frage zum Eintrag

Optionen (nur für Redakteure)
Redaktionelle Details anzeigen Redaktionelle Details anzeigen