A New Test-Generation Methodology for System-Level Verification of Production Processes

Author(s):  
Allon Adir ◽  
Alex Goryachev ◽  
Lev Greenberg ◽  
Tamer Salman ◽  
Gil Shurek
2022 ◽  
Vol 31 (1) ◽  
pp. 1-52
Author(s):  
Man Zhang ◽  
Andrea Arcuri

REST web services are widely popular in industry, and search techniques have been successfully used to automatically generate system-level test cases for those systems. In this article, we propose a novel mutation operator which is designed specifically for test generation at system-level, with a particular focus on REST APIs. In REST API testing, and often in system testing in general, an individual can have a long and complex chromosome. Furthermore, there are two specific issues: (1) fitness evaluation in system testing is highly costly compared with the number of objectives (e.g., testing targets) to optimize for; and (2) a large part of the genotype might have no impact on the phenotype of the individuals (e.g., input data that has no impact on the execution flow in the tested program). Due to these issues, it might be not suitable to apply a typical low mutation rate like 1/ n (where n is the number of genes in an individual), which would lead to mutating only one gene on average. Therefore, in this article, we propose an adaptive weight-based hypermutation, which is aware of the different characteristics of the mutated genes. We developed adaptive strategies that enable the selection and mutation of genes adaptively based on their fitness impact and mutation history throughout the search. To assess our novel proposed mutation operator, we implemented it in the EvoMaster tool, integrated in the MIO algorithm, and further conducted an empirical study with three artificial REST APIs and four real-world REST APIs. Results show that our novel mutation operator demonstrates noticeable improvements over the default MIO. It provides a significant improvement in performance for six out of the seven case studies, where the relative improvement is up to +12.09% for target coverage, +12.69% for line coverage, and +32.51% for branch coverage.


2017 ◽  
Vol 7 (1.2) ◽  
pp. 225
Author(s):  
Grandhi Prasuna ◽  
O. Naga Raju ◽  
C. Hari Kishan

Software testing is all too often simply a bug hunt rather than a well-considered exercise in ensuring quality. More methodical models than a simple cycle of system-level test-fail-patch-test will be required to deploy safe autonomous vehicles at scale. There are many types of software testing is used to test software. Efferent systems and procedure are proposed for dealing with these issues. Utilization of transformative calculations for programmed test generation has been a territory of intrigue. This assignment should be possible on a premise of the Ant Colony Optimization method (ACO) of Swarm Intelligence as it isn't profoundly contemplated yet. Intends to locate the most limited way and Resolve the time issue. We are building up extra particular way to deal with testing by concentrating on those parts that are most critical so these ways can be tried first recognizing the most huge ways, the testing productivity can be expanded. Great results are discovered astoundingly expediently when GA is actualized. Producing an improved test suite (TS) is meta-heuristic issue, which can be settled by GA. The only objective of programming is not to determine the algorithm to accomplish a result but relevance and correctness of the result. Also, Furthermore, to be ascertained. Genetic Algorithm is a meta-heuristic algorithm, is employed for optimizing path testing to achieve total code coverage.


Sign in / Sign up

Export Citation Format

Share Document