Using String Distances for Test Case Prioritisation

Yves Ledru 1 Alexandre Petrenko 2 Sergiy Boroday 2
1 VASCO
LIG - Laboratoire d'Informatique de Grenoble
2 CRIM - Centre de Recherche Informatique de Montréal
Abstract : 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. In this paper, 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 and can be useful for initial testing and in cases when code is difficult to instrument. We also briefly report on preliminary results of an experiment where the proposed prioritisation technique was compared with random permutations and four classical string distance metrics were evaluated.
Type de document :
Communication dans un congrès
Grundy, J. and Heimdahl, M. and Taentzer, G. 24th IEEE/ACM International Conference on Automated Software Engineering (ASE 2009), 2009, Auckland, New Zealand. IEEE, pp.510-514, 2009, 〈10.1109/ASE.2009.23〉
Liste complète des métadonnées
https://hal.inria.fr/hal-00953593
Contributeur : Catherine Oriat <>
Soumis le : vendredi 28 février 2014 - 13:54:35
Dernière modification le : jeudi 11 octobre 2018 - 08:48:04

Identifiants

Collections

LIG_GLSI | LIG_GLSI_VASCO | LIG | UGA | LIG_SRCPR

Citation

Yves Ledru, Alexandre Petrenko, Sergiy Boroday. Using String Distances for Test Case Prioritisation. Grundy, J. and Heimdahl, M. and Taentzer, G. 24th IEEE/ACM International Conference on Automated Software Engineering (ASE 2009), 2009, Auckland, New Zealand. IEEE, pp.510-514, 2009, 〈10.1109/ASE.2009.23〉. 〈hal-00953593〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

83

Contact


archive-ouverte@inria.fr