The Experts below are selected from a list of 342336 Experts worldwide ranked by ideXlab platform
Charles J. Colbourn - One of the best experts on this subject based on the ideXlab platform.
-
one Test at a time heuristic search for Interaction Test suites
Genetic and Evolutionary Computation Conference, 2007Co-Authors: Renee C Bryce, Charles J. ColbournAbstract:Algorithms for the construction of software Interaction Test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing Test suites for higher strength coverage. The combinatorial growth of t-tuples associated with higher strength hinders the efficacy of Interaction Testing. Test suites are inherently large, so Testers may not run entire Test suites. To address these problems, we combine a simple greedy algorithmallwith heuristic search to construct and dispense one Test at a time. Our algorithm attempts to maximize the number of t-tuples covered by the earliest Tests so that if a Tester only runs a partial Test suite, they Test as many t-tuples as possible.allHeuristic search is shown to provide effective methods for achieving such coverage.
-
GECCO - One-Test-at-a-time heuristic search for Interaction Test suites
Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07, 2007Co-Authors: Renee C Bryce, Charles J. ColbournAbstract:Algorithms for the construction of software Interaction Test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing Test suites for higher strength coverage. The combinatorial growth of t-tuples associated with higher strength hinders the efficacy of Interaction Testing. Test suites are inherently large, so Testers may not run entire Test suites. To address these problems, we combine a simple greedy algorithmallwith heuristic search to construct and dispense one Test at a time. Our algorithm attempts to maximize the number of t-tuples covered by the earliest Tests so that if a Tester only runs a partial Test suite, they Test as many t-tuples as possible.allHeuristic search is shown to provide effective methods for achieving such coverage.
-
a framework of greedy methods for constructing Interaction Test suites
International Conference on Software Engineering, 2005Co-Authors: Renee C Bryce, Charles J. Colbourn, Myra B CohenAbstract:Greedy algorithms for the construction of software Interaction Test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one Test at a time. Within this framework are many instantiations of greedy methods generalizing those in the literature. Greedy algorithms are popular when the time for Test suite construction is of paramount concern. We focus on the size of the Test suite produced by each instantiation. Experiments are analyzed using statistical techniques to determine the importance of the implementation decisions within the framework. This framework provides a platform for optimizing the accuracy and speed of "one-Test-at-a-time" greedy methods.
-
ICSE - A framework of greedy methods for constructing Interaction Test suites
Proceedings of the 27th international conference on Software engineering - ICSE '05, 2005Co-Authors: Renee C Bryce, Charles J. Colbourn, Myra B CohenAbstract:Greedy algorithms for the construction of software Interaction Test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one Test at a time. Within this framework are many instantiations of greedy methods generalizing those in the literature. Greedy algorithms are popular when the time for Test suite construction is of paramount concern. We focus on the size of the Test suite produced by each instantiation. Experiments are analyzed using statistical techniques to determine the importance of the implementation decisions within the framework. This framework provides a platform for optimizing the accuracy and speed of "one-Test-at-a-time" greedy methods.
-
ASE - Constructing Interaction Test suites with greedy algorithms
Proceedings of the 20th IEEE ACM international Conference on Automated software engineering - ASE '05, 2005Co-Authors: Renee C Bryce, Charles J. ColbournAbstract:Combinatorial approaches to Testing are used in several fields, and have recently gained momentum in the field of software Testing through software Interaction Testing. One-Test-at-a-time greedy algorithms are used to automatically construct such Test suites. This paper discusses basic criteria of why greedy algorithms have been appropriate for this Test generation problem in the past and then expands upon how greedy algorithms can be utilized to address Test suite prioritization.
Renee C Bryce - One of the best experts on this subject based on the ideXlab platform.
-
one Test at a time heuristic search for Interaction Test suites
Genetic and Evolutionary Computation Conference, 2007Co-Authors: Renee C Bryce, Charles J. ColbournAbstract:Algorithms for the construction of software Interaction Test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing Test suites for higher strength coverage. The combinatorial growth of t-tuples associated with higher strength hinders the efficacy of Interaction Testing. Test suites are inherently large, so Testers may not run entire Test suites. To address these problems, we combine a simple greedy algorithmallwith heuristic search to construct and dispense one Test at a time. Our algorithm attempts to maximize the number of t-tuples covered by the earliest Tests so that if a Tester only runs a partial Test suite, they Test as many t-tuples as possible.allHeuristic search is shown to provide effective methods for achieving such coverage.
-
GECCO - One-Test-at-a-time heuristic search for Interaction Test suites
Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07, 2007Co-Authors: Renee C Bryce, Charles J. ColbournAbstract:Algorithms for the construction of software Interaction Test suites have focussed on the special case of pairwise coverage; less is known about efficiently constructing Test suites for higher strength coverage. The combinatorial growth of t-tuples associated with higher strength hinders the efficacy of Interaction Testing. Test suites are inherently large, so Testers may not run entire Test suites. To address these problems, we combine a simple greedy algorithmallwith heuristic search to construct and dispense one Test at a time. Our algorithm attempts to maximize the number of t-tuples covered by the earliest Tests so that if a Tester only runs a partial Test suite, they Test as many t-tuples as possible.allHeuristic search is shown to provide effective methods for achieving such coverage.
-
APSEC - Interaction Testing in Model-Based Development: Effect on Model-Coverage
2006 13th Asia Pacific Software Engineering Conference (APSEC'06), 2006Co-Authors: Renee C Bryce, Ajitha Rajan, Mats P. E. HeimdahlAbstract:Model-based software development is gaining interest in domains such as avionics, space, and automotives. The model serves as the central artifact for the development efforts (such as, code generation), therefore, it is crucial that the model be extensively validated. Automatic generation of Interaction Test suites is a candidate for partial automation of this model validation task. Interaction Testing is a combinatorial approach that systematically Tests all t-way combinations of inputs for a system. In this paper, we report how well Interaction Test suites (2-way through 5-way Interaction Test suites) structurally cover a model of the mode- logic of a flight guidance system. We conducted experiments to (1) compare the coverage achieved with Interaction Test suites to that of randomly generated Tests and (2) determine if Interaction Test suites improve the coverage of black-box Test suites derived from system requirements. The experiments show that the Interaction Test suites provide little benefit over the randomly generated Tests and do not improve coverage of the requirements-based Tests. These findings raise questions on the application of Interaction Testing in this domain.
-
a framework of greedy methods for constructing Interaction Test suites
International Conference on Software Engineering, 2005Co-Authors: Renee C Bryce, Charles J. Colbourn, Myra B CohenAbstract:Greedy algorithms for the construction of software Interaction Test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one Test at a time. Within this framework are many instantiations of greedy methods generalizing those in the literature. Greedy algorithms are popular when the time for Test suite construction is of paramount concern. We focus on the size of the Test suite produced by each instantiation. Experiments are analyzed using statistical techniques to determine the importance of the implementation decisions within the framework. This framework provides a platform for optimizing the accuracy and speed of "one-Test-at-a-time" greedy methods.
-
ICSE - A framework of greedy methods for constructing Interaction Test suites
Proceedings of the 27th international conference on Software engineering - ICSE '05, 2005Co-Authors: Renee C Bryce, Charles J. Colbourn, Myra B CohenAbstract:Greedy algorithms for the construction of software Interaction Test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one Test at a time. Within this framework are many instantiations of greedy methods generalizing those in the literature. Greedy algorithms are popular when the time for Test suite construction is of paramount concern. We focus on the size of the Test suite produced by each instantiation. Experiments are analyzed using statistical techniques to determine the importance of the implementation decisions within the framework. This framework provides a platform for optimizing the accuracy and speed of "one-Test-at-a-time" greedy methods.
Bestoun S. Ahmed - One of the best experts on this subject based on the ideXlab platform.
-
ICST Workshops - Avocado: Open-Source Flexible Constrained Interaction Testing for Practical Application
2020 IEEE International Conference on Software Testing Verification and Validation Workshops (ICSTW), 2020Co-Authors: Jan Richter, Bestoun S. Ahmed, Miroslav Bures, Cleber R. Rosa JuniorAbstract:This paper presents the outcome of a research collaboration between academia and industry to implement and utilize the capabilities of constrained Interaction Testing for an open-source tool for industrial-scale application. The project helps promote flexibility in generating constrained Interaction Test suites, executing them, and setting up a Test oracle to report them–all within the same tool called Avocado. Avocado employs a constraint solver with computational algorithms to generate constrained Interaction Test suites. The environment of the application under Test can be set up to execute the generated Test suite with minimum effort. A Test oracle can be set up by the tool to report the status and the results of the executed Test cases. Avocado represents a comprehensive and flexible solution for conducting combinatorial Interaction Testing (CIT) and constrained CIT on an industrial application. In this paper, we present the structure of the tool and our method of implementing the algorithms in detail.
-
generation and application of constrained Interaction Test suites using base forbidden tuples with a mixed neighborhood tabu search
International Journal of Software Engineering and Knowledge Engineering, 2020Co-Authors: Imad H Hasan, Bestoun S. Ahmed, Moayad Yousif Potrus, Kamal Z. ZamliAbstract:To ensure the quality of current highly con¯gurable software systems, intensive Testing is needed to Test all the con¯guration combinations and detect all the possible faults. This task becomes mor ...
-
Avocado: Open-Source Flexible Constrained Interaction Testing for Practical Application
arXiv: Software Engineering, 2020Co-Authors: Jan Richter, Bestoun S. Ahmed, Miroslav Bures, Cleber R. Rosa JuniorAbstract:This paper presents the outcome of a research collaboration between academia and industry to implement and utilize the capabilities of constrained Interaction Testing for an open-source tool for industrial-scale application. The project helps promote flexibility in generating constrained Interaction Test suites, executing them, and setting up a Test oracle to report them--all within the same tool called Avocado. Avocado employs a constraint solver with computational algorithms to generate constrained Interaction Test suites. The environment of the application under Test can be set up to execute the generated Test suite with minimum effort. A Test oracle can be set up by the tool to report the status and the results of the executed Test cases. Avocado represents a comprehensive and flexible solution for conducting combinatorial Interaction Testing (CIT) and constrained CIT on an industrial application. In this paper, we present the structure of the tool and our method of implementing the algorithms in detail.
-
EASE - Towards an Automated Unified Framework to Run Applications for Combinatorial Interaction Testing
Proceedings of the Evaluation and Assessment on Software Engineering, 2019Co-Authors: Bestoun S. Ahmed, Cleber R. Rosa Junior, Amador Pahim, D. Richard Kuhn, Miroslav BuresAbstract:Combinatorial Interaction Testing (CIT) is a well-known technique, but the industrial experience is needed to determine its effectiveness in different application domains. We present a case study introducing a unified framework for generating, executing and verifying CIT Test suites, based on the open-source Avocado Test framework. In addition, we present a new industrial case study to demonstrate the effectiveness of the framework. This evaluation showed that the new framework can generate, execute, and verify effective combinatorial Interaction Test suites for detecting configuration failures (invalid configurations) in a virtualization system.
-
Towards an Automated Unified Framework to Run Applications for Combinatorial Interaction Testing.
arXiv: Software Engineering, 2019Co-Authors: Bestoun S. Ahmed, Cleber R. Rosa Junior, Amador Pahim, D. Richard Kuhn, Miroslav BuresAbstract:Combinatorial Interaction Testing (CIT) is a well-known technique, but the industrial experience is needed to determine its effectiveness in different application domains. We present a case study introducing a unified framework for generating, executing and verifying CIT Test suites, based on the open-source Avocado Test framework. In addition, we present a new industrial case study to demonstrate the effectiveness of the framework. This evaluation showed that the new framework can generate, execute, and verify effective combinatorial Interaction Test suites for detecting configuration failures (invalid configurations) in a virtualization system.
Saida Haider - One of the best experts on this subject based on the ideXlab platform.
-
curcumin restores rotenone induced depressive like symptoms in animal model of neurotoxicity assessment by social Interaction Test and sucrose preference Test
Metabolic Brain Disease, 2019Co-Authors: Syeda Madiha, Saida HaiderAbstract:Environmental toxin rotenone has been associated to with increased Parkinson's disease (PD) prevalence in population. Depression is one of the main non-motor symptoms of PD. Curcumin exhibits neuroprotective action in neurodegenerative diseases. In the study we investigated the effect of pre- and post-treatment of curcumin on rotenone-induced depressive-like behaviors and neurotransmitter alterations in rat model of PD. In pre-treatment phase rats were administered with curcumin (100 mg/kg/day, p.o.) for 2 weeks. After curcumin treatment rotenone (1.5 mg/kg/day, s.c.) was administered in Pre-Cur + Rot group and rotenone alone group for 8 days. Meanwhile, in Post-Cur + Rot group rotenone was injected for 8 days in order to develop PD-like symptoms. After rotenone administration curcumin (100 mg/kg/day, p.o.) was administered in Post-Cur + Rot group for 2 weeks. Depressive-like behaviors were monitored by the forced swim Test (FST), open field Test (OFT), sucrose preference Test (SPT) and social Interaction Test (SIT). Animals were decapitated after behavioral analysis, striatum and hippocampus were dissected out for neurochemical estimations. Results showed that the rotenone administration significantly (p < 0.01) produced depressive-like symptoms in all depression-related behavioral Test. All these behavioral deficits were accompanied by the reduction of striatal and hippocampal neurotransmitter levels following rotenone administration. Pre- and post-treatment with curcumin significantly (p < 0.01) reversed the depressive-like behavior induced by rotenone and significantly (p < 0.01) improved neurotransmitter levels as compared to rotenone injected rats. Our results strongly suggest that normalization of neurotransmitter levels particularly highlights the antidepressant effect of curcumin against rotenone-induced depressive behavior.
-
Curcumin restores rotenone induced depressive-like symptoms in animal model of neurotoxicity: assessment by social Interaction Test and sucrose preference Test
Metabolic Brain Disease, 2018Co-Authors: Syeda Madiha, Saida HaiderAbstract:Environmental toxin rotenone has been associated to with increased Parkinson’s disease (PD) prevalence in population. Depression is one of the main non-motor symptoms of PD. Curcumin exhibits neuroprotective action in neurodegenerative diseases. In the study we investigated the effect of pre- and post-treatment of curcumin on rotenone-induced depressive-like behaviors and neurotransmitter alterations in rat model of PD. In pre-treatment phase rats were administered with curcumin (100 mg/kg/day, p.o.) for 2 weeks. After curcumin treatment rotenone (1.5 mg/kg/day, s.c.) was administered in Pre-Cur + Rot group and rotenone alone group for 8 days. Meanwhile, in Post-Cur + Rot group rotenone was injected for 8 days in order to develop PD-like symptoms. After rotenone administration curcumin (100 mg/kg/day, p.o.) was administered in Post-Cur + Rot group for 2 weeks. Depressive-like behaviors were monitored by the forced swim Test (FST), open field Test (OFT), sucrose preference Test (SPT) and social Interaction Test (SIT). Animals were decapitated after behavioral analysis, striatum and hippocampus were dissected out for neurochemical estimations. Results showed that the rotenone administration significantly (p
Kamal Z. Zamli - One of the best experts on this subject based on the ideXlab platform.
-
generation and application of constrained Interaction Test suites using base forbidden tuples with a mixed neighborhood tabu search
International Journal of Software Engineering and Knowledge Engineering, 2020Co-Authors: Imad H Hasan, Bestoun S. Ahmed, Moayad Yousif Potrus, Kamal Z. ZamliAbstract:To ensure the quality of current highly con¯gurable software systems, intensive Testing is needed to Test all the con¯guration combinations and detect all the possible faults. This task becomes mor ...
-
Handling constraints in combinatorial Interaction Testing in the presence of multi objective particle swarm and multithreading
Information and Software Technology, 2017Co-Authors: Bestoun S. Ahmed, Luca Maria Gambardella, Wasif Afzal, Kamal Z. ZamliAbstract:ContextCombinatorial Testing strategies have lately received a lot of attention as a result of their diverse applications. In its simple form, a combinatorial strategy can reduce several input parameters (configurations) of a system into a small set based on their Interaction (or combination). In practice, the input configurations of software systems are subjected to constraints, especially in case of highly configurable systems. To implement this feature within a strategy, many difficulties arise for construction. While there are many combinatorial Interaction Testing strategies nowadays, few of them support constraints. ObjectiveThis paper presents a new strategy, to construct combinatorial Interaction Test suites in the presence of constraints. MethodThe design and algorithms are provided in detail. To overcome the multi-judgement criteria for an optimal solution, the multi-objective particle swarm optimisation and multithreading are used. The strategy and its associated algorithms are evaluated extensively using different benchmarks and comparisons. ResultsOur results are promising as the evaluation results showed the efficiency and performance of each algorithm in the strategy. The benchmarking results also showed that the strategy can generate constrained Test suites efficiently as compared to state-of-the-art strategies. ConclusionThe proposed strategy can form a new way for constructing of constrained combinatorial Interaction Test suites. The strategy can form a new and effective base for future implementations.
-
constructing a t way Interaction Test suite using the particle swarm optimization approach
International Journal of Innovative Computing Information and Control, 2012Co-Authors: Bestoun S. Ahmed, Kamal Z. Zamli, Chee Peng LimAbstract:This paper presents the design and implementation of a new t-way Test generation strategy, known as the Particle Swarm Test Generator (PSTG). Complementing the existing work on t-way Testing strategies, PSTG serves as our research vehicle to investigate the applicability of Particle Swarm Optimization for t-way Test data generation. The experimental results demonstrate that PSTG is capable of outperforming some of the existing strategies as far as the Test size is concerned. Additionally, the evaluation also indicates the effectiveness of PSTG in generating an efficient Test suite for Testing consideration.
-
a variable strength Interaction Test suites generation strategy using particle swarm optimization
Journal of Systems and Software, 2011Co-Authors: Bestoun S. Ahmed, Kamal Z. ZamliAbstract:This paper highlights a novel strategy for generating variable-strength (VS) Interaction Test suites, called VS Particle Swarm Test Generator (VS-PSTG). As the name suggests, VS-PSTG adopts Particle Swarm Optimization to ensure optimal Test size reduction. To determine its efficiency in terms of the size of the generated Test suite, VS-PSTG was subjected to well-known benchmark configurations. Comparative results indicate that VS-PSTG gives competitive results as compared to existing strategies. An empirical case study was conducted on a non-trivial software system to show the applicability of the strategy and to determine the effectiveness of the generated Test suites to detect faults.
-
Development of Interaction Test suite generation strategy with input-output mapping supports
Scientific Research and Essays, 2011Co-Authors: H. Y. Ong, Kamal Z. ZamliAbstract:Software Testing relates to the process of finding errors/defects and/or ensuring that a particular software of interest meets its specification. One of the key activities within software Testing is on the Test case design. Over the years, many Test case design strategies have been developed in the literature including that of boundary values, equivalence partitioning, decision tables, robustness consideration as well as cost and effect graphing. Although useful, these strategies do not sufficiently cater for bugs due to Interaction. Addressing the aforementioned issue, many researches into Interaction based strategies, called t-way strategies (where t represents Interaction strength), have started to emerge in the literature. This paper presents the development of a new t-way strategy called AURA. AURA strategy serves as our research vehicle to investigate the usefulness of automated mapping based on input-output relationship as well as its flexible iteration control for constructing t-way Test suite. Benchmarking results demonstrate that AURA strategy gives competitive results against most existing strategies. Key words: Interaction Testing, t-way Testing, variable strength Interaction Testing, input-output based relationship Interaction Testing, automated mapping support.