GWW metaheuristic to solve constraints on floating point numbers and application to test case generation Online publication date: Mon, 20-Jun-2016
by Mohamed Sayah; Yahia Lebbah
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 7, No. 2, 2016
Abstract: We propose a population-based local search approach to generate automatically test cases for programs having floating point statements. The proposed approach, called GWW-MLFP (go with the winners using multi-precision arithmetic and local search for floating point constraints), adopts the GWW metaheutistic to solve constraints on floating point numbers which have a huge cardinality (e.g., 252 numbers in [0.5, 1.0]) and huge values (e.g., 10300): the search space is of exponential nature, motivating using an approximate approach. GWW-MLFP is a population-based metaheuristic which uses a set of candidates as a diversification mechanism. A set of B particles are maintained in each iteration. Consequently, different initial candidates are considered and different regions in the search space are explored. First, particles are randomly generated. Second, a dedicated local search algorithm on floating point numbers, called MLFP, is applied on each particle. In the following iterations of GWW-MLFP, the particles are processed until no particle remains under some given objective value. We have implemented the GWW-MLFP approach, and we have shown its usefulness on various non-trivial floating point programs.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com