A methodology for controlling the size of a test suite
ACM Transactions on Software Engineering and Methodology (TOSEM)
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Software unit test coverage and adequacy
ACM Computing Surveys (CSUR)
Effect of test set minimization on fault detection effectiveness
Software—Practice & Experience
An empirical study of regression test selection techniques
ACM Transactions on Software Engineering and Methodology (TOSEM)
Prioritizing Test Cases For Regression Testing
IEEE Transactions on Software Engineering
Test Case Prioritization: A Family of Empirical Studies
IEEE Transactions on Software Engineering
Proceedings of the 24th International Conference on Software Engineering
Test Set Size Minimization and Fault Detection Effectiveness: A Case Study in a Space Application
COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
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
ISSRE '03 Proceedings of the 14th International Symposium on Software Reliability Engineering
Empirical Software Engineering
A hybrid heuristic for the maximum clique problem
Journal of Heuristics
TimeAware test suite prioritization
Proceedings of the 2006 international symposium on Software testing and analysis
Search Algorithms for Regression Test Case Prioritization
IEEE Transactions on Software Engineering
An Empirical Study of Test Case Filtering Techniques Based on Exercising Information Flows
IEEE Transactions on Software Engineering
Call-Stack Coverage for GUI Test Suite Reduction
IEEE Transactions on Software Engineering
Introduction to Software Testing
Introduction to Software Testing
Prioritizing User-Session-Based Test Cases for Web Applications Testing
ICST '08 Proceedings of the 2008 International Conference on Software Testing, Verification, and Validation
Configuration-aware regression testing: an empirical study of sampling and prioritization
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
An algorithm for capturing variables dependences in test suites
Journal of Systems and Software
Generating profile-based signatures for online intrusion and failure detection
Information and Software Technology
Hi-index | 0.00 |
Test case filtering is concerned with selecting from a test suite T a subset T' that is capable of revealing most of the defects revealed by T. A smaller T' is desirable since it translates to fewer test runs to be audited manually. Test case prioritization, a related technique, aims at scheduling the tests in T so that the defects are revealed as early as possible when T gets executed. We propose techniques that are based on coverage of combinations of program elements of different types. Clearly, exploring all possible combinations induced at runtime is infeasible, which calls for the use of an approximation algorithm. In this paper we investigate the use of a genetic algorithm to select a number of suitable combinations of program elements to be covered. We compared our technique to other coverage-based techniques that consider program elements of the same type and that do not take into account their combinations; our preliminary results were promising. For example, after filtering the original test suite T for JTidy, the resulting T' revealed all the defects in T and was only 14.1% its size.