Specification-based testing methods generate test data without the knowledge of structure program. However, quality these are not well ensured to detect bugs when non-functional changes introduced To effectively, we propose a new method that combines formal specifications with genetic algorithm (GA). In this method, reformed by GA in order be used input values can kill as many mutants target pr...

These notes present the work that I have done in the first six months of my PhD. The research topic is on how to apply search algorithms to Software Engineering problems. Among these many problems, I chose to investigate the “Test Data Generation” for Object Oriented Software. A review of the literature related to this problem is presented. A justification on why this particular problem has bee...

A number of approaches have been proposed to automatically generate test data to traverse a given path in a program. In this paper, we present a program execution based approach to generate test data for a given path. The technique derives a desired input for a test path by iteratively reening an arbitrarily chosen input. A set of linear constraints on the increments to the input are derived to...

Among the tasks in software testing, test data generation is particularly difficult and costly. In recent years, several approaches that use metaheuristic search techniques to automatically obtain the test inputs have been proposed. Although work in this field is very active, little attention has been paid to the selection of an appropriate search space. The present work describes an alternativ...

The study of automatically generate test data based on evolutionary algorithm method focuseson the path coverage direction. The key problem is how to construct a suitable and has a good orientation of the fitness function to evaluate the quality of a test data. This paper introduces several evolution test methods, shows its advantages and problemsit can effectively solve, and proposesan improve...

Domain testing is a well-known software testing technique. Although research tasks have been initiated in domain testing, automatic test data generation based on character string predicates has not yet been reported. This paper presents a novel approach to automatically generate ON-OFF test points for character string predicate borders associated with program paths, and describes a correspondin...

This paper presents an iterative approximation refinement, called raSATloop, which solves a system of polynomial inequalities on real numbers. The approximation scheme consists of interval arithmetic (over-approximation, aiming to decide UNSAT) and testing (under-approximation, aiming to decide SAT). If both of them fail to decide, input intervals are refined by decomposition, a refinement step...

Recently, search based techniques have received great attention as a means of automating the test data generation activity. On the contrary, more traditional methods that automate the test data generation usually employ symbolic execution by incorporating a path generation phase and constraint solvers to produce the sought test data. In this paper, the benefits of both schools of thought are br...