Using String Distances for Test Case Prioritisation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Using String Distances for Test Case Prioritisation


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.
No file

Dates and versions

hal-00953593 , version 1 (28-02-2014)



Yves Ledru, Alexandre Petrenko, Sergiy Boroday. Using String Distances for Test Case Prioritisation. 24th IEEE/ACM International Conference on Automated Software Engineering (ASE 2009), 2009, Auckland, New Zealand. pp.510-514, ⟨10.1109/ASE.2009.23⟩. ⟨hal-00953593⟩
57 View
0 Download



Gmail Facebook X LinkedIn More