The testing of configurations with constraints still faces a great challenge. Although artificial intelligence (AI)-based algorithms perform better than greedy algorithms on [Formula: see text]-way testing because of the good searching ability of optimal solutions, only a few AI-based algorithms can support constraints currently. Moreover, the AI-based algorithms can only ignore the conflicting candidate test cases subject to constraints, even though they are optimal. In this paper, we demonstrate two novel particle swarm optimization (PSO)-based constraint test cases generation (PCTG) methods. In the two methods, the strategies of avoiding the selection of conflicting test cases and replacing conflicting test cases are applied to handle constraints, respectively. They guide the process of searching for optimal solutions from different perspectives, according to different handling of constraints. We evaluate the availability of these two methods with some excellent existing strategies in terms of performance. The evaluation results indicate that our proposed methods, in most cases, outperform other strategies as far as the generated constraints covering array sizes.
At present, the lack of insight into the problem of mode mixing in Empirical Mode Decomposition (EMD) hinders the development of solutions to the problem. Starting with the phenomenon that the EMD decomposition cannot be accomplished when the number of signal extrema is abnormal, the causes of mode mixing were investigated and the conclusion was reached that there are only two basic types of mode mixing. In light of this finding, the mechanisms of the three typical mode mixing solutions and their limitations were analyzed. It was found from the analysis process and results that the findings of this study regarding the causes and types of mode mixing were correct.
Although combinatorial testing has been widely studied and used, there are still some situations and requirements that combinatorial testing does not apply to well, such as a system under test whose test cases need to be performed contiguously. For thorough testing, the testing requirements are not only to cover all the interactions among factors but also to cover all the value sequences of every factor. Generally, systems under test always involve constraints and dependencies in or among test cases. The constraints among test cases have not been effectively specified. First, we introduce extended covering arrays that can achieve both t-way combinatorial coverage and t-wise sequence coverage, and propose a clocked computation tree logic-based formal specification method for specifying constraints. Then, Particle Swarm Optimization (PSO) based Extended covering array Generator (PEG) is elaborated. To evaluate the constructed test suites, a method for verifying the constraints' validity is presented, and kernel functions for measuring the coverage are also introduced. Finally, the performance of the proposed PEG is evaluated using several sets of benchmark experiments for some common constraints, and the feasibility and usefulness of PEG is validated.
Testing of real-time embedded systems (RTESs) under input timing constraints is a critical issue. Models which can specify timing constraints have respective merits and demerits and test suites which can cover more input possibilities and detect more faults under input timing constraints are worthy of study. In this paper, clocked computation tree logic which is used to specify input timing constraints is presented. Neighbor covering arrays and parallel input time correlation test suites are introduced to test RTESs under serial and parallel input timing constraints. Three algorithms are described in generating test suites, respectively, and corresponding random testing-based algorithms which are used as baselines for comparison are introduced. Benchmarks with different configurations are conducted to evaluate the algorithms' performance. Three real-world RTESs are tested with the test suites described in this paper, respectively. The test results show that random testing may omit some neighbor input time point combinations as the randomness and increase test suite scales. This fact may lead to the omission of some faults and heavy costs. Therefore, the proposed test suites are more effective and efficient for testing RTESs under input timing constraints. INDEX TERMS Real-time embedded systems, input timing constraints, test suite generation, random testing.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.