Generating combinatorial test suite using combinatorial optimization
Authors:
- Zhiqiang ZhangZZZhiqiang Zhang
- Jun YanJYJun Yan
- Yong ZhaoYZYong Zhao
- Jian ZhangJZJian Zhang
- 1 December 2014
- journal article
- Published by Elsevier in Journal of Systems and Software
- Vol. 98, 191-207
Abstract
No abstract availableFunding Information
- 973 Program of China (2014CB340701)
- National Science Foundation of China (61100064)
This publication has 15 references indexed in Scilit:
- Metaheuristic approach for constructing functional test‐suitesIET Software, 2013
- Conflict-driven answer set solving: From theory to practiceArtificial Intelligence, 2012
- Evaluating improvements to a meta-heuristic search for constrained interaction testingEmpirical Software Engineering, 2010
- Constructing Interaction Test Suites for Highly-Configurable Systems in the Presence of Constraints: A Greedy ApproachIEEE Transactions on Software Engineering, 2008
- A density‐based greedy algorithm for higher strength covering arraysSoftware Testing, Verification and Reliability, 2008
- The density algorithm for pairwise interaction testingSoftware Testing, Verification and Reliability, 2007
- Prioritized interaction testing for pair-wise coverage with seeding and constraintsInformation and Software Technology, 2006
- Constraint-Based Approaches to the Covering Test ProblemLecture Notes in Computer Science, 2005
- Problems and algorithms for covering arraysDiscrete Mathematics, 2004
- The AETG system: an approach to testing based on combinatorial designIEEE Transactions on Software Engineering, 1997