MVSCA: Multi-Valued Sequence Covering Array

Younis, Mohammed Issam

doi:10.31026/j.eng.2019.11.07

Cited by 7 publications

(7 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There is at least one CA/MCA for every t-way combination of parameter value. Since CAs and MCAs have proven to be useful in numerous industries, researchers are looking at the best approaches to develop optimal CAs and MCAs [37], [38].…”

Section: Combinatorial Testingmentioning

confidence: 99%

Innovations in t-way test creation based on a hybrid hill climbing-greedy algorithm

Fadhil

Abdullah

Younis

2023

IJ-AI

View full text Add to dashboard Cite

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. This study presents a hybrid greedy hill climbing algorithm (HGHC) that ensures both effectiveness and near-optimal results for generating a small number of test data. To make certain that the suggested HGHC outperforms the most used techniques in terms of test size. It is compared to others in order to determine its effectiveness. In contrast to recent practices utilized for the production of covering arrays (CAs) and mixed covering arrays (MCAs), this hybrid strategy is superior since allowing it to provide the utmost outcome while reducing the size and limit the loss of unique pairings in the CA/MCA generation.</p>

show abstract

Section: Combinatorial Testingmentioning

confidence: 99%

Innovations in t-way test creation based on a hybrid hill climbing-greedy algorithm

Fadhil

Abdullah

Younis

2023

IJ-AI

View full text Add to dashboard Cite

show abstract

“…Combination sequences were studied in [20] , combining configuration and the order of combinations while also considering constraints. Another structure defined as a sequence covering array of t-way combinations has been termed a multi-valued sequence covering array, introduced in [25] .…”

Section: Related Workmentioning

confidence: 99%

Ordered t-way Combinations for Testing State-based Systems

Kuhn¹

2022

View full text Add to dashboard Cite

Fault detection often depends on the specific order of inputs that establish states which eventually lead to a failure. However, beyond basic structural coverage metrics, it is often difficult to determine if code has been exercised sufficiently to ensure confidence in its functions. Measures are needed to ensure that relevant combinations of input values have been tested with adequate diversity of ordering to ensure correct operation. Combinatorial testing and combinatorial coverage measures have been applied to many types of applications but have some deficiencies for verifying and testing state-based systems where the response depends on both input values and the current system state. In such systems, internal states change as input values are processed. Examples include network protocols, which may be in listening, partial connection, full connection, disconnected, and many other states depending on the values of packet fields and the order of packets received. Similarly, merchant account balances in credit card systems change continuously as transactions are processed. This publication introduces a notion of ordered t-way combinations, proves a result regarding the construction of adequate blocks of test inputs, and discusses the application of the results to verify and test state-based systems.

show abstract

“…SCAs are used so far for testing graphical user interfaces (26)(27)(28), testing a factory automation system (21,29), and combined with CAs to handle multi-values sequence covering array (30).…”

Section: Related Workmentioning

confidence: 99%

DEO: A Dynamic Event Order Strategy for t-way Sequence Covering Array Test Data Generation

Younis

2020

Baghdad Sci.J

View full text Add to dashboard Cite

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of coverage. Motivated by such challenge, this paper proposes a novel SCA strategy called Dynamic Event Order (DEO), in which the test case generation is done using one-parameter-at-a-time fashion. The details of the DEO are presented with a step-by-step example to demonstrate the behavior and show the correctness of the proposed strategy. In addition, this paper makes a comparison with existing computational strategies. The practical results demonstrate that the proposed DEO strategy outperforms the existing strategies in term of minimal test size in most cases. Moreover, the significance of the DEO increases as the number of sequences increases and/ or the strength of coverage increases. Furthermore, the proposed DEO strategy succeeds to generate SCAs up to t=7. Finally, the DEO strategy succeeds to find new upper bounds for SCA. In fact, the proposed strategy can act as a research vehicle for variants future implementation.

show abstract

MVSCA: Multi-Valued Sequence Covering Array

Cited by 7 publications

References 25 publications

Innovations in t-way test creation based on a hybrid hill climbing-greedy algorithm

Innovations in t-way test creation based on a hybrid hill climbing-greedy algorithm

Ordered t-way Combinations for Testing State-based Systems

DEO: A Dynamic Event Order Strategy for t-way Sequence Covering Array Test Data Generation

Contact Info

Product

Resources

About