Subsumption in Mutation Testing: An Automated Model Based on Genetic Algorithm

Fault in a software program can be detected by mutation testing. However, mutation testing is an expensive process in a software testing domain. In this paper, we have introduced a method based on genetic algorithm and mutation analysis for unit testing process. Software industry produces high quality software in which software testing has an important role. First, we make a program/software and intent some mutant in this program/software, find most critical path and optimise test cases using genetic algorithm for the unit testing. Initially generated test cases are refined using genetic algorithm. We use a mutant function for measuring the adequacy of the test case set. The given mutant function is used to calculate a mutant score. We have achieved 100% path coverage and boundary coverage using mutation testing. The objective is to produce a set of good test cases for killing one or more undesired mutants and produces different mutant from original software/program. Unlike simple algorithms, genetic algorithms provide suitability for reducing the data generation at a comparable cost. An optimised test case has been generated by proposed approach for cost reduction and revealing or killing undesired test cases.

Fault in a software program can be detected by mutation testing. However, mutation testing is an expensive process in a software testing domain. In this paper, we have introduced a method based on genetic algorithm and mutation analysis for unit testing process. Software industry produces high quality software in which software testing has an important role. First, we make a program/software and intent some mutant in this program/software, find most critical path and optimise test cases using genetic algorithm for the unit testing. Initially generated test cases are refined using genetic algorithm. We use a mutant function for measuring the adequacy of the test case set. The given mutant function is used to calculate a mutant score. We have achieved 100% path coverage and boundary coverage using mutation testing. The objective is to produce a set of good test cases for killing one or more undesired mutants and produces different mutant from original software/program. Unlike simple algorithms, genetic algorithms provide suitability for reducing the data generation at a comparable cost. An optimised test case has been generated by proposed approach for cost reduction and revealing or killing undesired test cases.

When using genetic and evolutionary algorithms for network design, choosing a good representation scheme for the construction of the genotype is important for algorithm performance. One of the most common representation schemes for networks is the characteristic vector representation. However, with encoding trees, and using crossover and mutation, invalid individuals occur that are either under- or over-specified. When constructing the offspring or repairing the invalid individuals that do not represent a tree, it is impossible to distinguish between the importance of the links that should be used. These problems can be overcome by transferring the concept of random keys from scheduling and ordering problems to the encoding of trees. This paper investigates the performance of a simple genetic algorithm (SGA) using network random keys (NetKeys) for the one-max tree and a real-world problem. The comparison between the network random keys and the characteristic vector encoding shows that despite the effects of stealth mutation, which favors the characteristic vector representation, selectorecombinative SGAs with NetKeys have some advantages for small and easy optimization problems. With more complex problems, SGAs with network random keys significantly outperform SGAs using characteristic vectors. This paper shows that random keys can be used for the encoding of trees, and that genetic algorithms using network random keys are able to solve complex tree problems much faster than when using the characteristic vector. Users should therefore be encouraged to use network random keys for the representation of trees.

The work on mutation testing has attracted a lot of attention during the last decades. Mutation testing is a powerful mechanism to improve the quality of test suites based on the injection of syntactic changes into the code of the original program. Several studies have focused on reducing the high computational cost of applying this technique and increasing its efficiency. Only some of them have tried to do it through the application of genetic algorithms. Genetic algorithms can guide through the generation of a reduced subset of mutants without significant loss of information. In this paper, we analyse recent advances in mutation testing that contribute to reduce the cost associated to this technique and propose to apply them for addressing current drawbacks in Evolutionary Mutation Testing (EMT), a genetic algorithm based technique with promising experimental results so far.

I come from a family in which there have been no scientists or doctors. I was interested, however, in biology at school and started my scientific career by training in medicine at Oxford University and Guys Hospital, London. Practising as a doctor reinforced my curiosity about the biological processes underlying human disease. As a consequence, I pursued a clinical vocation in histopathology, a discipline that couples exposure to the sights and smells of the autopsy room with a daily journey into the often beautiful, sometimes ugly world of healthy and diseased human tissues under the microscope. After an introduction to general histopathology in Nick Wright's department at the Hammersmith Hospital, London, I completed my postgraduate medical training in neuropathology with Peter Lantos at the Maudsley Hospital, London.Peering at the nuclei of cancer cells under the microscope, for me it was a matter of fascination that hidden within them were the key events converting normal cells into cancer cells, and frustration because they were out of reach. Many of the tissue samples examined by pathologists are from cancers. The clonal theory of cancer development and the general role of DNA mutations in generating cancer cell clones had been established by 1986 when I was working as a junior pathologist. Indeed, the first mutated cancer gene, HRAS , had recently been identified through application of the, then new, technologies of recombinant DNA technology. Peering at the nuclei of cancer cells under the microscope, for me it was a matter of fascination that hidden within them were the key events converting normal cells into cancer cells, and frustration because they were out of reach. So, I took 3 years break from medicine to study for a PhD, learning the methods and thinking of molecular oncology in Colin Cooper's laboratory at the Institute …

Testing is an important activity in engineering of industrial embedded software. In certain application domains (e.g., railway industry) engineering software is certified according to safety standards that require extensive software testing procedures to be applied for the development of reliable systems. Mutation analysis is a technique for creating faulty versions of a software for the purpose of examining the fault detection ability of a test suite. Mutation analysis has been used for evaluating existing test suites, but also for generating test suites that detect injected faults (i.e., mutation testing). To support developers in software testing, we propose a technique for producing test cases using an automated test generation approach that operates using mutation testing for software written in IEC 61131-3 language, a programming standard for safety-critical embedded software, commonly used for Programmable Logic Controllers (PLCs). This approach uses the Uppaal model checker and is based on a combined model that contains all the mutants and the original program. We applied this approach in a tool for testing industrial PLC programs and evaluated it in terms of cost and fault detection. For realistic validation we collected industrial experimental evidence on how mutation testing compares with manual testing as well as automated decision-coverage adequate test generation. In the evaluation, we used manually seeded faults provided by four industrial engineers. The results show that even if mutation-based test generation achieves better fault detection than automated decision coverage-based test generation, these mutation-adequate test suites are not better at detecting faults than manual test suites. However, the mutation-based test suites are significantly less costly to create, in terms of testing time, than manually created test suites. Our results suggest that the fault detection scores could be improved by considering some new and improved mutation operators (e.g., Feedback Loop Insertion Operator (FIO)) for PLC programs as well as higher-order mutations.

The use of Genetic Algorithms in evolution of mutants and test cases offers new possibilities in addressing some of the main problems of mutation testing. Most specifically the problem of equivalent mutant detection, and the problem of the large number of mutants produced. In this paper we describe the above problems in detail and introduce a new methodology based on co-evolutionary search techniques using Genetic Algorithms in order to address them effectively. Co-evolution allows the parallel evolution of mutants and test cases. We discuss the advantages of this approach over other existing mutation testing techniques, showing details of some initial experimental results carried out.KeywordsGenetic AlgorithmMutation OperatorSoftware TestMutation TestingOriginal ProgramThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This chapter builds the foundation of software testing techniques by classifying the various testing approaches and testing coverage criteria. It gradually advances in the concepts and process of Mutation Testing and its application areas. Mutation testing has been applied at both the source code level and specification level of the software under test. Mutation testing, when applied to the source code, is named as Program Mutation. Similarly, when applied to the specifications, it is named as Specification Mutation. The relevant Mutation Testing tools available for different programming languages for both program and Specification Mutations are hereby listed. Owing to the high cost incurred in applying Mutation Testing to industrial needs, the on-going endeavors of the researchers in the area are elaborated here. Applying nature-inspired algorithms along with Mutation Testing for data generation/selection/minimization is an upcoming area of research. Search based Mutation Testing (SBMT) applies evolutionary techniques like Genetic Algorithms or other metaheuristic approaches for automating the tasks associated with mutation testing, which otherwise requires a lot of human effort, thus, making it a practical approach. This chapter concludes by giving the seminal recent advancements in the area.

Artificial neural networks (ANN) and evolutionary algorithms are two relatively young research areas that were subject to a steadily growing interest during the past years. This paper examines the use of different evolutionary algorithms, imperialist competitive algorithm (ICA), genetic algorithm (GA), ICA-GA and recursive ICA-GA (R-ICA-GA) to train a classification problem on a multi layer perceptron (MLP) neural network. All of named evolutionary training algorithms are compared together in this paper. The first goal of the paper is to apply new evolutionary optimization algorithms ICA-GA and R-ICA-GA for training the ANN and the second goal of the paper is to compare different evolutionary algorithms. It is shown that the ICA-GA has the best performance, in number of epochs, compared to the other algorithms. For this purpose, learning algorithms are applied on six known datasets (WINE, PIMA, WDBC, IRIS, SONAR and GLASS) which are used for classification problems.

Detection of Mutant BRAF Alleles in the Plasma of Patients with Metastatic Melanoma

During the last two decades, the water resources planning and management profession has seen a dramatic increase in the development and application of various types of evolutionary algorithms (EAs). This observation is especially true for application of genetic algorithms, arguably the most popular of the several types of EAs. Generally speaking, EAs repeatedly prove to be flexible and powerful tools in solving an array of complex water resources problems. This paper provides a comprehensive review of state-of-the-art methods and their applications in the field of water resources planning and management. A primary goal in this ASCE Task Committee effort is to identify in an organized fashion some of the seminal contributions of EAs in the areas of water distribution systems, urban drainage and sewer systems, water supply and wastewater treatment, hydrologic and fluvial modeling, groundwater systems, and parameter identification. The paper also identifies major challenges and opportunities for the future, ...

Search-based Mutation Testing makes use of Meta-heuristic optimization techniques like Genetic Algorithm, Hill Climbing and other such Evolutionary Approaches for the process of mutation testing. This paper presents the opportunities and challenges faced in applying Search-based techniques to mutation testing. Enormous amount of research has been done in the recent years in this area. The major challenge is the storage and computational cost for a large set of mutants. This paper also lists the latest research, available tools and updates to SBMT.

With the development of science and technology, there has been growing the grid size, the growing demand for electricity and the extent of increasing the electricity market.In this paper, a mathematical morphology and genetic algorithm based dynamic reactive power optimization method for distribution network is proposed.By means of constructing mathematical morphology filter, the binary image composed by allelic genes of chromosome is filtered and the problem that deals with the action times of voltage regulating devices for compensation is turned into filtering problem of discrete binary image.With further automate scheduling, distribution automation and unmanned substation reactive power optimization of distribution line running made an urgent request.Reactive power optimization can improve the voltage passing rate, increasing the reliability of the system, the power quality, and the system runs the security and economy of the perfect combination, very broad application prospects.

The role of K-ras gene mutation analysis in EUS-guided FNA cytology specimens for the differential diagnosis of pancreatic solid masses: a meta-analysis of prospective studies

A Brief Retrospective Report on the Feasibility of Epidermal Growth Factor Receptor and KRAS Mutation Analysis in Transesophageal Ultrasound- and Endobronchial Ultrasound-Guided Fine Needle Cytological Aspirates