A hybrid kidney algorithm strategy for combinatorial interaction testing problem

Combinatorial Interaction Testing (CIT) generates a sampled test case set (Final Test Suite (FTS)) instead of all possible test cases. Generating the FTS with the optimum size is a computational optimization problem (COP) as well as a Non-deterministic Polynomial hard (NP-hard) problem. Recent studies have implemented hybrid metaheuristic algorithms as the basis for CIT strategy. However, the existing hybrid metaheuristic-based CIT strategies generate a competitive FTS size, there is no single CIT strategy can overcome others existing in all cases. In addition, the hybrid metaheuristic-based CIT strategies require more execution time than their own original algorithm-based strategies. Kidney Algorithm (KA) is a recent metaheuristic algorithm and has high efficiency and performance in solving different optimization problems against most of the state-of-the-art of metaheuristic algorithms. However, KA has limitations in the exploitation and exploration processes as well as the balancing control process is needed to be improved. These shortages cause KA to fail easily into the local optimum. This study proposes a low-level hybridization of KA with the mutation operator and improve the filtration process in KA to form a recently Hybrid Kidney Algorithm (HKA). HKA addresses the limitations in KA by improving the algorithm's exploration and exploitation processes by hybridizing KA with mutation operator, and improve the balancing control process by enhancing the filtration process in KA. HKA improves the efficiency in terms of generating an optimum FTS size and enhances the performance in terms of the execution time. HKA has been adopted into the CIT strategy as HKA based CIT Strategy (HKAS) to generate the most optimum FTS size. The results of HKAS shows that HKAS can generate the optimum FTS size in more than 67% of the benchmarking experiments as well as contributes by 34 new optimum size of FTS. HKAS also has better efficiency and performance than KAS. HKAS is the first hybrid metaheuristic-based CIT strategy that generates an optimum FTS size with less execution time than the original algorithm-based CIT strategy. Apart from supporting different CIT features: uniform/VS CIT, IOR CIT as well as the interaction strength up to 6, this study also introduces another recently variant of KA which are Improved KA (IKA) and Mutation KA (MKA) as well as new CIT strategies which are IKA-based (IKAS) and MKA-based (MKAS)

A systematic review on cloud testing

A systematic literature review is presented that surveyed the topic of cloud testing over the period (2012-2017). Cloud testing can refer either to testing cloud-based systems (testing of the cloud), or to leveraging the cloud for testing purposes (testing in the cloud): both approaches (and their combination into testing of the cloud in the cloud) have drawn research interest. An extensive paper search was conducted by both automated query of popular digital libraries and snowballing, which resulted into the final selection of 147 primary studies. Along the survey a framework has been incrementally derived that classifies cloud testing research along six main areas and their topics. The paper includes a detailed analysis of the selected primary studies to identify trends and gaps, as well as an extensive report of the state of art as it emerges by answering the identified Research Questions. We find that cloud testing is an active research field, although not all topics have received so far enough attention, and conclude by presenting the most relevant open research challenges for each area of the classification framework.This paper describes research work mostly undertaken in the context of the European Project H2020 731535: ElasTest. This work has also been partially supported by: the Italian MIUR PRIN 2015 Project: GAUSS; the Regional Government of Madrid (CM) under project Cloud4BigData (S2013/ICE-2894) cofunded by FSE & FEDER; and the Spanish Government under project LERNIM (RTC-2016-4674-7) cofunded by the Ministry of Economy and Competitiveness, FEDER & AEI

Combinatorial Testing in Cloud Computing [electronic resource] /

This book introduces readers to an advanced combinatorial testing approach and its application in the cloud environment. Based on test algebra and fault location analysis, the proposed combinatorial testing method can support experiments with 250 components (with 2 * (250) combinations), and can detect the fault location based on the testing results. This function can efficiently decrease the size of candidate testing sets and therefore increase testing efficiency. The proposed solution’s effectiveness in the cloud environment is demonstrated using a range of experiments.1. Introduction -- 2. Related Work -- 3. Adaptive Fault Detection in Multi-Tenancy SaaS -- 4. Test Algebra for Concurrent Combinatorial Testing -- 5. Algebra Execution with Combinatorial Testing -- 6. Test Algebra Execution in A Cloud Environment -- 7. Adaptive Reasoning Algorithm with Automated Test Cases Generation qnd Test Algebra in SaaS System -- 8. TaaS Design for Combinatorial Testing -- 9. Integrated TaaS with Fault Detection and Test Algebra.This book introduces readers to an advanced combinatorial testing approach and its application in the cloud environment. Based on test algebra and fault location analysis, the proposed combinatorial testing method can support experiments with 250 components (with 2 * (250) combinations), and can detect the fault location based on the testing results. This function can efficiently decrease the size of candidate testing sets and therefore increase testing efficiency. The proposed solution’s effectiveness in the cloud environment is demonstrated using a range of experiments