A methodology for controlling the size of a test suite
ACM Transactions on Software Engineering and Methodology (TOSEM)
Experiments of the effectiveness of dataflow- and controlflow-based test adequacy criteria
ICSE '94 Proceedings of the 16th international conference on Software engineering
Test set size minimization and fault detection effectiveness: a case study in a space application
Journal of Systems and Software
Prioritizing Test Cases For Regression Testing
IEEE Transactions on Software Engineering
Test Case Prioritization: A Family of Empirical Studies
IEEE Transactions on Software Engineering
Effectively prioritizing tests in development environment
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Test-Suite Reduction and Prioritization for Modified Condition/Decision Coverage
IEEE Transactions on Software Engineering
On Test Coverage Metrics for Communication Protocols
Proceedings of the IFIP TC6/WG6.1 Fourth International Workshop on Protocol Test Systems IV
Test Selection, Trace Distance and Heuristics
TestCom '02 Proceedings of the IFIP 14th International Conference on Testing Communicating Systems XIV
An Empirical Study of the Effects of Minimization on the Fault Detection Capabilities of Test Suites
ICSM '98 Proceedings of the International Conference on Software Maintenance
Automatic Test Generation using Checkpoint Encoding and Antirandom Testing
ISSRE '97 Proceedings of the Eighth International Symposium on Software Reliability Engineering
A Study of Effective Regression Testing in Practice
ISSRE '97 Proceedings of the Eighth International Symposium on Software Reliability Engineering
Empirical Software Engineering
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Experiences in coverage testing of a Java middleware
SEM '05 Proceedings of the 5th international workshop on Software engineering and middleware
l22 spreading metrics for vertex ordering problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
TimeAware test suite prioritization
Proceedings of the 2006 international symposium on Software testing and analysis
An empirical analysis and comparison of random testing techniques
Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering
Search Algorithms for Regression Test Case Prioritization
IEEE Transactions on Software Engineering
On the effect of test-suite reduction on automatically generated model-based tests
Automated Software Engineering
Test suite reduction and prioritization with call trees
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
PHALANX: a graph-theoretic framework for test case prioritization
Proceedings of the 2008 ACM symposium on Applied computing
Configuration-aware regression testing: an empirical study of sampling and prioritization
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
Adaptive Random Test Case Prioritization
ASE '09 Proceedings of the 2009 IEEE/ACM International Conference on Automated Software Engineering
Using String Distances for Test Case Prioritisation
ASE '09 Proceedings of the 2009 IEEE/ACM International Conference on Automated Software Engineering
Optimal string edit distance based test suite reduction for SDL specifications
SDL'09 Proceedings of the 14th international SDL conference on Design for motes and mobiles
Reducing the cost of model-based testing through test case diversity
ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Static test case prioritization using topic models
Empirical Software Engineering
| Hi-index | 0.00 |
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.