Practical minimization of pairwise-covering test configurations using constraint programming
- 1 March 2016
- journal article
- Published by Elsevier in Information and Software Technology
- Vol. 71, 129-146
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- T‐wise combinatorial interaction test suites construction based on coverage inheritanceSoftware Testing, Verification and Reliability, 2011
- Evaluating improvements to a meta-heuristic search for constrained interaction testingEmpirical Software Engineering, 2010
- A density‐based greedy algorithm for higher strength covering arraysSoftware Testing, Verification and Reliability, 2008
- IPOG/IPOG‐D: efficient test generation for multi‐way combinatorial testingSoftware Testing, Verification and Reliability, 2007
- Generic semantics of feature diagramsComputer Networks, 2007
- Constraint Models for the Covering Test ProblemConstraints, 2006
- Combination testing strategies: a surveySoftware Testing, Verification and Reliability, 2005
- Formalizing cardinality‐based feature models and their specializationSoftware Process: Improvement and Practice, 2005
- Software fault interactions and implications for software testingIEEE Transactions on Software Engineering, 2004
- The AETG system: an approach to testing based on combinatorial designIEEE Transactions on Software Engineering, 1997