List of Articles prime path

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - Constraint Search based Test Data Generation to cover Prime Paths in Structural Testing
  Ebrahim Fazli Mojtaba Aajami
  This paper presents a novel scalable Constraint Search Based method forTest Data Generation, called CSBTDG, used in structural testing. CSBTDG outperforms existing methods for test data generation in several orders of magnitude, both in time and constraint efficiency. S More

  This paper presents a novel scalable Constraint Search Based method forTest Data Generation, called CSBTDG, used in structural testing. CSBTDG outperforms existing methods for test data generation in several orders of magnitude, both in time and constraint efficiency. Search-based software testing is a powerful automated method to generate test inputs for software under test. Its goal is to reach a branch or a statement in a program. One major limitation of this approach is an insufficiently informed fitness function to start and guide search toward a test target within nested predicates (constraints). Another important limitation of this approach about equality constraints. To address these problems we propose a new search method based on integrating constraint programming using choco constraint solver and the Gray Wolf heuristic search algorithm. Preliminary experiments promise efficiency and effectiveness for the new constraint search based test data generation approach using multiple fitness functions.Test data generation is done by solving constraints related to test paths extracted from the program under test [3][2]. In general, the constraint solving problem of the test paths is a sub problem of a wider set of problems called constraint satisfaction problem (CSP) [4]. Formally, a constraint satisfaction problem is defined as a triple (X, D, C). X represents a set of variables, D is a set of range of values for variables and C is a set of constraints. Constraint satisfaction is the process of finding solutions for a set of constraints that satisfy the conditions imposed on the variables. Evaluation of variables is a function of a subset of variables to a specific set of values in the corresponding domains. The proposed solution is called consistent evaluation if none of the constraints are violated. An evaluation is a complete evaluation if it includes all variables. If the assessment is consistent and complete, it is a solution. It is said that such evaluation is a solution to the constraint satisfaction problem. Therefore, a solution is a set of values for the variables that satisfy all the constraints, that is, a point in the feasible region. The main innovation of this article is to present a cooperation model to exchange information between the solver and the searcher. In this model of data generation, the test solver is an initial setup to assign values to some variables to start searching for the meta-heuristic algorithm. Manuscript profile