Orthogonal Latin squares: an application of experiment design to compiler testing
Communications of the ACM
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
Black-box test reduction using input-output analysis
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Digital Design
A Test Generation Strategy for Pairwise Testing
IEEE Transactions on Software Engineering
In-Parameter-Order: A Test Generation Strategy for Pairwise Testing
HASE '98 The 3rd IEEE International Symposium on High-Assurance Systems 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
Efficient software testing protocols
CASCON '98 Proceedings of the 1998 conference of the Centre for Advanced Studies on Collaborative research
Generating Expected Results for Automated Black-Box Testing
Proceedings of the 17th IEEE international conference on Automated software engineering
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
Software component interaction testing: coverage measurement and generation of configurations
Software component interaction testing: coverage measurement and generation of configurations
Combining Behavior and Data Modeling in Automated Test Case Generation
QSIC '03 Proceedings of the Third International Conference on Quality Software
Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
A framework of greedy methods for constructing interaction test suites
Proceedings of the 27th international conference on Software engineering
MuJava: an automated class mutation system: Research Articles
Software Testing, Verification & Reliability
Constraint Models for the Covering Test Problem
Constraints
Coverage and adequacy in software product line testing
Proceedings of the ISSTA 2006 workshop on Role of software architecture for testing and analysis
Backtracking Algorithms and Search Heuristics to Generate Test Suites for Combinatorial Testing
COMPSAC '06 Proceedings of the 30th Annual International Computer Software and Applications Conference - Volume 01
Combinatorial testing: learnings from our experience
ACM SIGSOFT Software Engineering Notes
Managing Conflicts When Using Combination Strategies to Test Software
ASWEC '07 Proceedings of the 2007 Australian Software Engineering Conference
IPOG: A General Strategy for T-Way Software Testing
ECBS '07 Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems
Pseudo-Exhaustive Testing for Software
SEW '06 Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop
Interaction testing of highly-configurable systems in the presence of constraints
Proceedings of the 2007 international symposium on Software testing and analysis
Exploiting Constraint Solving History to Construct Interaction Test Suites
TAICPART-MUTATION '07 Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION
Software testing processes as a linear dynamic system
Information Sciences: an International Journal
Practical Combinatorial Testing: Beyond Pairwise
IT Professional
A backtracking search tool for constructing combinatorial test suites
Journal of Systems and Software
IPOG-IPOG-D: efficient test generation for multi-way combinatorial testing
Software Testing, Verification & Reliability
A rigorous approach towards test case generation
Information Sciences: an International Journal
IRPS --- An Efficient Test Data Generation Strategy for Pairwise Testing
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I
G2Way A Backtracking Strategy for Pairwise Test Data Generation
APSEC '08 Proceedings of the 2008 15th Asia-Pacific Software Engineering Conference
Information Sciences: an International Journal
Software execution processes as an evolving complex network
Information Sciences: an International Journal
A density-based greedy algorithm for higher strength covering arrays
Software Testing, Verification & Reliability
Assessing IRPS as an efficient pairwise test data generation strategy
International Journal of Advanced Intelligence Paradigms
Automatic test generation for n-way combinatorial testing
QoSA'05 Proceedings of the First international conference on Quality of Software Architectures and Software Quality, and Proceedings of the Second International conference on Software Quality
New bounds for binary covering arrays using simulated annealing
Information Sciences: an International Journal
Information and Software Technology
Constraints dependent t-way test suite generation using harmony search strategy
PKAW'12 Proceedings of the 12th Pacific Rim conference on Knowledge Management and Acquisition for Intelligent Systems
Hi-index | 0.07 |
To ensure an acceptable level of quality and reliability of a typical software product, it is desirable to test every possible combination of input data under various configurations. However, due to the combinatorial explosion problem, exhaustive testing is practically impossible. Resource constraints, cost factors, and strict time-to-market deadlines are some of the main factors that inhibit such a consideration. Earlier research has suggested that a sampling strategy (i.e., one that is based on a t-way parameter interaction) can be effective. As a result, many helpful t-way sampling strategies have been developed and can be found in the literature. Several advances have been achieved in the last 15years, which have, in particular, served to facilitate the test planning process by systematically minimizing the test size required (based on certain t-way parameter interactions). Despite this significant progress, the integration and automation of strategies (from planning process to execution) are still lacking. Additionally, strategizing to sample (and construct) a minimum test set from the exhaustive test space is an NP-complete problem; that is, it is often unlikely that an efficient strategy exists that could regularly generate an optimal test set. Motivated by these challenges, this paper discusses the design, implementation, and validation of an efficient strategy for t-way testing, the GTWay strategy. The main contribution of GTWay is the integration of t-way test data generation with automated (concurrent) execution as part of its tool implementation. Unlike most previous methods, GTWay addresses the generation of test data for a high coverage strength (t6).