Lexicographic codes: Error-correcting codes from game theory
IEEE Transactions on Information Theory
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
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
Determination of Test Configurations for Pair-Wise Interaction Coverage
TestCom '00 Proceedings of the IFIP TC6/WG6.1 13th International Conference on Testing Communicating Systems: Tools and Techniques
Constructing test suites for interaction testing
Proceedings of the 25th International Conference on Software Engineering
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)
A practical strategy for testing pair-wise coverage of network interfaces
ISSRE '96 Proceedings of the The Seventh 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
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
Design and Analysis of Experiments
Design and Analysis of Experiments
Automatic generation of high coverage usability tests
CHI '05 Extended Abstracts on Human Factors in Computing Systems
Proceedings of the 5th international workshop on Software and performance
Test prioritization for pairwise interaction coverage
A-MOST '05 Proceedings of the 1st international workshop on Advances in model-based testing
Modeling requirements for combinatorial software testing
A-MOST '05 Proceedings of the 1st international workshop on Advances in model-based testing
Constructing interaction test suites with greedy algorithms
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
Constraint Models for the Covering Test Problem
Constraints
Interaction testing of highly-configurable systems in the presence of constraints
Proceedings of the 2007 international symposium on Software testing and analysis
One-test-at-a-time heuristic search for interaction test suites
Proceedings of the 9th annual conference on Genetic and evolutionary computation
PHALANX: a graph-theoretic framework for test case prioritization
Proceedings of the 2008 ACM symposium on Applied computing
Merging covering arrays and compressing multiple sequence alignments
Discrete Applied Mathematics
Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing
TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
A logic-based approach to combinatorial testing with constraints
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
A survey of combinatorial testing
ACM Computing Surveys (CSUR)
MiTS: a new approach of tabu search for constructing mixed covering arrays
MICAI'10 Proceedings of the 9th Mexican international conference on Artificial intelligence conference on Advances in soft computing: Part II
Construction of mixed covering arrays of variable strength using a tabu search approach
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Information Sciences: an International Journal
Evaluating improvements to a meta-heuristic search for constrained interaction testing
Empirical Software Engineering
The Minimal Failure-Causing Schema of Combinatorial Testing
ACM Transactions on Software Engineering and Methodology (TOSEM)
Optimal shortening of covering arrays
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Regression testing minimization, selection and prioritization: a survey
Software Testing, Verification & Reliability
T-wise combinatorial interaction test suites construction based on coverage inheritance
Software Testing, Verification & Reliability
| Hi-index | 0.00 |
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one test at a time. Within this framework are many instantiations of greedy methods generalizing those in the literature. Greedy algorithms are popular when the time for test suite construction is of paramount concern. We focus on the size of the test suite produced by each instantiation. Experiments are analyzed using statistical techniques to determine the importance of the implementation decisions within the framework. This framework provides a platform for optimizing the accuracy and speed of "one-test-at-a-time" greedy methods.