A methodology for controlling the size of a test suite
ACM Transactions on Software Engineering and Methodology (TOSEM)
Dominators, super blocks, and program coverage
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Experiments of the effectiveness of dataflow- and controlflow-based test adequacy criteria
ICSE '94 Proceedings of the 16th international conference on Software engineering
Effect of test set minimization on fault detection effectiveness
Software—Practice & Experience
Efficient coverage testing using global dominator graphs
Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Test-Suite Reduction and Prioritization for Modified Condition/Decision Coverage
IEEE Transactions on Software Engineering
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
Using Spanning Sets for Coverage Testing
IEEE Transactions on Software Engineering
Bi-Criteria Models for All-Uses Test Suite Reduction
Proceedings of the 26th International Conference on Software Engineering
A Scalable Approach to User-Session based Testing of Web Applications through Concept Analysis
Proceedings of the 19th IEEE international conference on Automated software engineering
Improving Fault Detection Capability by Selectively Retaining Test Cases during Test Suite Reduction
IEEE Transactions on Software Engineering
Modification analysis support at the requirements level
Ninth international workshop on Principles of software evolution: in conjunction with the 6th ESEC/FSE joint meeting
Applying Concept Analysis to User-Session-Based Testing of Web Applications
IEEE Transactions on Software Engineering
Feature interaction analysis: a maintenance perspective
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Test suite reduction and prioritization with call trees
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
A novel approach for test suite reduction based on requirement relation contraction
Proceedings of the 2008 ACM symposium on Applied computing
Analysis of test suite reduction with enhanced tie-breaking techniques
Information and Software Technology
An empirical study of incorporating cost into test suite reduction and prioritization
Proceedings of the 2009 ACM symposium on Applied Computing
MINTS: A general framework and tool for supporting test-suite minimization
ICSE '09 Proceedings of the 31st International Conference on Software Engineering
A Bi-objective Model Inspired Greedy Algorithm for Test Suite Minimization
FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
On the estimation of adequate test set size using fault failure rates
Journal of Systems and Software
A test suite reduction approach based on pairwise interaction of requirements
Proceedings of the 2011 ACM Symposium on Applied Computing
A minimal test suite generation method based on quotient space theory
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Reduction of test suites using mutation
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Regression testing minimization, selection and prioritization: a survey
Software Testing, Verification & Reliability
Bi-criteria test suite reduction by cluster analysis of execution profiles
CEE-SET'09 Proceedings of the 4th IFIP TC 2 Central and East European conference on Advances in Software Engineering Techniques
Minimizing test suites in software product lines using weight-based genetic algorithms
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Efficient and flexible GUI test execution via test merging
Proceedings of the 2013 International Symposium on Software Testing and Analysis
| Hi-index | 0.00 |
Software testing and retesting occurs continuously during the software development lifecycle to detect errors as early as possible and to ensure that changes to existing software do not break the software. Test suites once developed are reused and updated frequently as the software evolves. As a result, some test cases in the test suite may become redundant as the software is modified over time since the requirements covered by them are also covered by other test cases. Due to the resource and time constraints for re-executing large test suites, it is important to develop techniques to minimize available test suites by removing redundant test cases. In general, the test suite minimization problem is NP complete. In this paper, we present a new greedy heuristic algorithm for selecting a minimal subset of a test suite T that covers all the requirements covered by T. We show how our algorithm was inspired by the concept analysis framework. We conducted experiments to measure the extent of test suite reduction obtained by our algorithm and prior heuristics for test suite minimization. In our experiments, our algorithm always selected same size or smaller size test suite than that selected by prior heuristics and had comparable time performance.