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
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
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
A Measure for Component Interaction Test Coverage
AICCSA '01 Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications
Augmenting Simulated Annealing to Build Interaction Test Suites
ISSRE '03 Proceedings of the 14th International Symposium on Software Reliability Engineering
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
A framework of greedy methods for constructing interaction test suites
Proceedings of the 27th international conference on Software engineering
Modeling requirements for combinatorial software testing
A-MOST '05 Proceedings of the 1st international workshop on Advances in model-based testing
Covering Arrays for Efficient Fault Characterization in Complex Configuration Spaces
IEEE Transactions on Software Engineering
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
Configuration-aware regression testing: an empirical study of sampling and prioritization
ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
Covering Arrays Avoiding Forbidden Edges
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Incremental covering array failure characterization in large configuration spaces
Proceedings of the eighteenth international symposium on Software testing and analysis
Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing
TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
Covering arrays avoiding forbidden edges
Theoretical Computer Science
Interaction Coverage Meets Path Coverage by SMT Constraint Solving
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
A logic-based approach to combinatorial testing with constraints
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Eliminating products to test in a software product line
Proceedings of the IEEE/ACM international conference on Automated software engineering
Program fields for continuous software
Proceedings of the FSE/SDP workshop on Future of software engineering research
A survey of combinatorial testing
ACM Computing Surveys (CSUR)
Automated incremental pairwise testing of software product lines
SPLC'10 Proceedings of the 14th international conference on Software product lines: going beyond
A Formal Logic Approach to Constrained Combinatorial Testing
Journal of Automated Reasoning
Information Sciences: an International Journal
Reducing combinatorics in testing product lines
Proceedings of the tenth international conference on Aspect-oriented software development
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)
Using binary decision diagrams for combinatorial test design
Proceedings of the 2011 International Symposium on Software Testing and Analysis
Using feature locality: can we leverage history to avoid failures during reconfiguration?
Proceedings of the 8th workshop on Assurances for self-adaptive systems
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
Theoretical Computer Science
A variable strength interaction test suites generation strategy using Particle Swarm Optimization
Journal of Systems and Software
Industrial evaluation of pairwise SPL testing with MoSo-PoLiTe
Proceedings of the Sixth International Workshop on Variability Modeling of Software-Intensive Systems
Finding the best CAFE is NP-hard
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Information and Software Technology
Optimizing the automatic test generation by SAT and SMT solving for Boolean expressions
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Evolutionary algorithm for prioritized pairwise test data generation
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Incremental model-based testing of delta-oriented software product lines
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
Pairwise testing for software product lines: comparison of two approaches
Software Quality Control
Model-based pairwise testing for feature interaction coverage in software product line engineering
Software Quality Control
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
SPLat: lightweight dynamic analysis for reducing combinatorics in testing configurable systems
Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Practical pairwise testing for software product lines
Proceedings of the 17th International Software Product Line Conference
Constructing test cases for n-wise testing from tree-based test models
Proceedings of the Fourth Symposium on Information and Communication Technology
Towards statistical prioritization for software product lines testing
Proceedings of the Eighth International Workshop on Variability Modelling of Software-Intensive Systems
| Hi-index | 0.00 |
Combinatorial interaction testing (CIT) is a method to sample configurations of a software system systematically for testing. Many algorithms have been developed that create CIT samples, however few have considered the practical concerns that arise when adding constraints between combinations of options. In this paper, we survey constraint handling techniques in existing algorithms and discuss the challenges that they present. We examine two highly-configurable software systems to quantify the nature of constraints in real systems. We then present a general constraint representation and solving technique that can be integrated with existing CIT algorithms and compare two constraint-enhanced algorithm implementations with existing CIT tools to demonstrate feasibility.