scholarly journals An Efficient Functional Test Generation Method For Processors Using Genetic Algorithms

2015 ◽  
Vol 66 (4) ◽  
pp. 185-193 ◽  
Author(s):  
Ján Hudec ◽  
Elena Gramatová
Keyword(s):  
Genetic Algorithms ◽  
Test Generation ◽  
Functional Test ◽  
Evolutionary Strategies ◽  
Instruction Set ◽  
Functional Tests ◽  
Automatic Test Generation ◽  
Code Coverage ◽  
Fitness Functions

Abstract The paper presents a new functional test generation method for processors testing based on genetic algorithms and evolutionary strategies. The tests are generated over an instruction set architecture and a processor description. Such functional tests belong to the software-oriented testing. Quality of the tests is evaluated by code coverage of the processor description using simulation. The presented test generation method uses VHDL models of processors and the professional simulator ModelSim. The rules, parameters and fitness functions were defined for various genetic algorithms used in automatic test generation. Functionality and effectiveness were evaluated using the RISC type processor DP32.

scholarly journals Supporting Unit Test Generation via Automated Isolation

2017 ◽  
Vol 61 (2) ◽  
pp. 116 ◽  
Author(s):  
Dávid Honfi ◽  
Zoltán Micskei
Keyword(s):  
Open Source ◽  
Test Generation ◽  
Symbolic Execution ◽  
Source Code ◽  
Unit Test ◽  
Prototype Implementation ◽  
Code Coverage ◽  
Novel Approach ◽  
Dynamic Symbolic Execution

Testing is a significantly time-consuming, yet commonly employed activity to improve the quality of software. Thus, techniques like dynamic symbolic execution were proposed for generating tests only from source code. However, current approaches usually could not create thorough tests for software units with dependencies (e.g. calls to file system or external services). In this paper, we present a novel approach that synthesizes an isolation sandbox, which interacts with the test generator to increase the covered behaviour in the unit under test. The approach automatically transforms the code of the unit under test, and lets the test generator choose values for parameters in the calls to dependencies. The paper presents a prototype implementation that collaborates with the IntelliTest test generator. The automated isolation is evaluated on source code from open-source projects. The results show that the approach can significantly increase the code coverage achieved by the generated tests.

Comparative analysis of intelligent planning methods

2012 ◽  
Vol 9 (2) ◽  
pp. 53-57 ◽  
Author(s):  
O.V. Darintsev ◽  
A.B. Migranov
Keyword(s):  
Neural Networks ◽  
Genetic Algorithms ◽  
Fuzzy Logic ◽  
Comparative Analysis ◽  
Mobile Robots ◽  
Sensory Information ◽  
Working Environment ◽  
Planning Methods ◽  
Intelligent Planning

The main stages of solving the problem of planning movements by mobile robots in a non-stationary working environment based on neural networks, genetic algorithms and fuzzy logic are considered. The features common to the considered intellectual algorithms are singled out and their comparative analysis is carried out. Recommendations are given on the use of this or that method depending on the type of problem being solved and the requirements for the speed of the algorithm, the quality of the trajectory, the availability (volume) of sensory information, etc.

Task scheduling algorithm based on improved genetic algorithm in cloud computing environment

2020 ◽  
Vol 13 ◽  
Author(s):  
Ge Weiqing ◽  
Cui Yanru
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Task Scheduling ◽  
Scheduling Algorithm ◽  
Task Completion ◽  
Improved Genetic Algorithm ◽  
Fitness Functions ◽  
Task Scheduling Algorithm ◽  
Simulation Results

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.

Computing the Medical Image Registration Using Meta-Heuristics

2014 ◽  
Vol 643 ◽  
pp. 237-242 ◽  
Author(s):  
Tahari Abdou El Karim ◽  
Bendakmousse Abdeslam ◽  
Ait Aoudia Samy
Keyword(s):  
Image Processing ◽  
Genetic Algorithms ◽  
Simulated Annealing ◽  
Image Registration ◽  
Cost Function ◽  
Population Genetic ◽  
Medical Image ◽  
Medical Image Registration ◽  
Anatomical Structures

The image registration is a very important task in image processing. In the field of medical imaging, it is used to compare the anatomical structures of two or more images taken at different time to track for example the evolution of a disease. Intensity-based techniques are widely used in the multi-modal registration. To have the best registration, a cost function expressing the similarity between these images is maximized. The registration problem is reduced to the optimization of a cost function. We propose to use neighborhood meta-heuristics (tabu search, simulated annealing) and a meta-heuristic population (genetic algorithms). An evaluation step is necessary to estimate the quality of registration obtained. In this paper we present some results of medical image registration

Sign in / Sign up

Export Citation Format

Share Document