Orthogonal Latin squares: an application of experiment design to compiler testing
Communications of the ACM
Computer Benchmark Evaluation and Design of Experiments: A Case Study
IEEE Transactions on Computers
Applying design of experiments to software testing: experience report
ICSE '97 Proceedings of the 19th international conference on Software engineering
The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
Model-based testing in practice
Proceedings of the 21st international conference on Software engineering
Prioritizing test cases for regression testing
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Incorporating varying test costs and fault severities into test case prioritization
ICSE '01 Proceedings of the 23rd International Conference on Software Engineering
Test Case Prioritization: A Family of Empirical Studies
IEEE Transactions on Software Engineering
A new method for constructing pair-wise covering designs for software testing
Information Processing Letters
A Test Generation Strategy for Pairwise Testing
IEEE Transactions on Software Engineering
Constructing test suites for interaction testing
Proceedings of the 25th International Conference on Software Engineering
Understanding and Measuring the Sources of Variation in the Prioritization of Regression Test Suites
METRICS '01 Proceedings of the 7th International Symposium on Software Metrics
An Investigation of the Applicability of Design of Experiments to Software Testing
SEW '02 Proceedings of the 27th Annual NASA Goddard Software Engineering Workshop (SEW-27'02)
Test Case Prioritization: An Empirical Study
ICSM '99 Proceedings of the IEEE International Conference on Software Maintenance
A Study of Effective Regression Testing in Practice
ISSRE '97 Proceedings of the Eighth International Symposium on Software Reliability Engineering
Generating Test Cases for GUI Responsibilities Using Complete Interaction Sequences
ISSRE '00 Proceedings of the 11th International Symposium on Software Reliability Engineering
A Measure for Component Interaction Test Coverage
AICCSA '01 Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications
Efficient Evaluation of Multifactor Dependent System Performance Using Fractional Factorial Design
IEEE Transactions on Software Engineering
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships
QSIC '03 Proceedings of the Third International Conference on Quality Software
Upper bounds for covering arrays by tabu search
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
Software Fault Interactions and Implications for Software Testing
IEEE Transactions on Software Engineering
Covering arrays for efficient fault characterization in complex configuration spaces
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
On test suite composition and cost-effective regression testing
ACM Transactions on Software Engineering and Methodology (TOSEM)
A framework of greedy methods for constructing interaction test suites
Proceedings of the 27th international conference on Software engineering
Progressive Ranking and Composition of Web Services Using Covering Arrays
WORDS '05 Proceedings of the 10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems
Constructing interaction test suites with greedy algorithms
Proceedings of the 20th 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
A survey of combinatorial testing
ACM Computing Surveys (CSUR)
Evaluating workloads using multi-comparative functional coverage
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
The Minimal Failure-Causing Schema of Combinatorial Testing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Coverage-Based, prioritized testing using neural network clustering
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Regression testing minimization, selection and prioritization: a survey
Software Testing, Verification & Reliability
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
| Hi-index | 0.00 |
Interaction testing is widely used in screening for faults. In software testing, it provides a natural mechanism for testing systems to be deployed on a variety of hardware and software configurations. Several algorithms published in the literature are used as tools to automatically generate these test suites; AETG is a well known example of a family of greedy algorithms that generate one test at a time. In many applications where interaction testing is needed, the entire test suite is not run as a result of time or cost constraints. In these situations, it is essential to prioritize the tests. Here we adapt a "one-test-at-a-time" greedy method to take importance of pairs into account. The method can be used to generate a set of tests in order, so that when run to completion all pairwise interactions are tested, but when terminated after any intermediate number of tests, those deemed most important are tested. Computational results on the method are reported.