2017
DOI: 10.1109/access.2017.2771562
|View full text |Cite
|
Sign up to set email alerts
|

Constrained Interaction Testing: A Systematic Literature Study

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
44
0
1

Year Published

2018
2018
2021
2021

Publication Types

Select...
5
2
1

Relationship

3
5

Authors

Journals

citations
Cited by 57 publications
(45 citation statements)
references
References 108 publications
0
44
0
1
Order By: Relevance
“…One can find two recent trends in research for combinatorial interaction testing: handling of constraints [28] and the application of meta-heuristic algorithms. Many current studies focus on the use of meta-heuristic algorithms as part of the greedy computational approach for CA construction [29,30,31].…”
Section: Combinatorial T − Wise Test Suite Generatorsmentioning
confidence: 99%
See 1 more Smart Citation
“…One can find two recent trends in research for combinatorial interaction testing: handling of constraints [28] and the application of meta-heuristic algorithms. Many current studies focus on the use of meta-heuristic algorithms as part of the greedy computational approach for CA construction [29,30,31].…”
Section: Combinatorial T − Wise Test Suite Generatorsmentioning
confidence: 99%
“…The Q-table will be updated accordingly based on the quality/performance of the current state-action pairs (lines 18-24). Like EMCQ, the Monte Carlo Metropolis probability controls the selection of search operators when the quality of the solution improves (lines [25][26][27][28][29][30]. This probability decreases with iteration (T ).…”
Section: Q-learning Monte Carlo Hyper-heuristic Strategymentioning
confidence: 99%
“…Kuhn et al [5] broadly covered many practical aspects of unconstrained CIT. Ahmed et al [6] presented an intensive and systematic literature survey of constrained CIT, addressing the current generation strategies, tools, and applications. From the mentioned studies, it can be observed that there are three categories of generation approaches that can be classified based on generation techniques: greedy algorithms, metaheuristic search algorithms, and mathematical or algebraic methods.…”
Section: Related Workmentioning
confidence: 99%
“…strained CIT (CCIT) can be seen as a current trend and future direction of CIT [10,6,3]. CCIT is considered a part of CIT that is a nondeterministic polynomial time (NP-hard) problem [11].…”
mentioning
confidence: 99%
“…. v k )) or MCA(N ; t, k, v k ) may be adopted when the number of component values varies, while the Constrained Covering Array (CCA) may be adopted when there are constraints among the values of input parameters [3].…”
Section: Background and Literaturementioning
confidence: 99%