Prioritising Test Cases with String Distances - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Automated Software Engineering Année : 2012

Prioritising Test Cases with String Distances

Résumé

Test case prioritisation aims at finding an ordering which enhances a certain property of an ordered test suite. Traditional techniques rely on the availability of code or a specification of the program under test. We propose to use string distances on the text of test cases for their comparison and elaborate a prioritisation algorithm. Such a prioritisation does not require code or a specification and can be useful for initial testing and in cases when code is difficult to instrument. In this paper, we also report on experiments performed on the "Siemens Test Suite", where the proposed prioritisation technique was compared with random permutations and four classical string distance metrics were evaluated. The obtained results, confirmed by a statistical analysis, indicate that prioritisation based on string distances is more efficient in finding defects than random ordering of the test suite: the test suites prioritized using string distances are more efficient in detecting the strongest mutants, and, on average, have a better APFD than randomly ordered test suites. The results suggest that string distances can be used for prioritisation purposes, and Manhattan distance could be the best choice.

Dates et versions

hal-00857278 , version 1 (03-09-2013)

Identifiants

Citer

Yves Ledru, Alexandre Petrenko, Sergiy Boroday, Nadine Mandran. Prioritising Test Cases with String Distances. Automated Software Engineering, 2012, 19 (1), pp.65-95. ⟨10.1007/s10515-011-0093-0⟩. ⟨hal-00857278⟩
3344 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More