00000cab a22000003a 4500 UP-99796217608835926 Buklod 20231007234832.0 m |o d | ta 090525s xx d | ||r ||||| || DENGII eng Edvardsson, Jon Analysis of the constraint solver in UNA based test data generation. pp. 237-245 In a series of articles Gupta et al. develop a framework for automatic test data generation for computer programs. In general, their approach consists of a branch predicate collector, which derives a system of linear inequalities representing the branch predicates for a given path in the program. This system is solved using a solving technique of theirs called the Unified Numerical Approach (UNA) [5, 7]. In this paper we show that in contrast to traditional optimization methods the UNA is not bounded by the size of the solved system. Instead it depends on how input is composed. That is, even for very simple systems consisting of one variable we can easily get more than a thousand iterations. We will also give a formal proof that UNA does not always find a mixed integer solution when there is one. Finally, we suggest using some traditional optimization method instead, like the simplex method in combination with branch-and-bound and/or a cutting-plane algorithm as a constraint solver. Software. Software engineering. Testing and debugging. Testing tools (e.g., data generators, coverage testing). Mathematics of computing. Numerical analysis. Optimization. Integer programming. Linear programming. Algorithms. Performance. Theory. Constraint solver. Unified numerical approach. Software engineering notes. 26, 5 (2001). FO UPD DENG-II Article