Simulated annealing applied to test generation: landscape characterization and stopping criteria

This paper investigates a measurement approach to support the implementation of Simulated Annealing (SA) applied to test generation. SA, like other metaheuristics, is a generic technique that must be tuned to the testing problem under consideration. Finding an adequate setting of SA parameters, that will offer good performance for the target problem, is known to be difficult. Our measurement approach is intended to guide the implementation choices to be made. It builds upon advanced research on how to characterize search problems and the dynamics of metaheuristic techniques applied to them. Central to this research is the concept of landscape. Existing measures of landscape have mainly been applied to combinatorial problems considered in complexity theory. We show that some of these measures can be useful for testing problems as well. The diameter and autocorrelation are retained to study the adequacy of alternative settings of SA parameters. A new measure, the Generation Rate of Better Solutions (GRBS), is introduced to monitor convergence of the search process and implement stopping criteria. The measurement approach is experimented on various case studies, and allows us to successfully revisit a problem issued from our previous work on testing control systems.

[1]  Mark Harman,et al.  How to Overcome the Equivalent Mutant Problem and Achieve Tailored Selective Mutation Using Co-evolution , 2004, GECCO.

[2]  David Connolly An improved annealing scheme for the QAP , 1990 .

[3]  Bernd Freisleben,et al.  Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..

[4]  Makoto Yokoo,et al.  Why Adding More Constraints Makes a Problem Easier for Hill-climbing Algorithms: Analyzing Landscapes of CSPs , 1997, CP.

[5]  John J. Grefenstette,et al.  Learning to break things: Adaptive testing of intelligent controllers , 1997 .

[6]  Terry Jones,et al.  Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.

[7]  Jin-Kao Hao,et al.  Landscapes and the Maximal Constraint Satisfaction Problem , 1999, Artificial Evolution.

[8]  John A. Clark,et al.  Automated program flaw finding using simulated annealing , 1998, ISSTA '98.

[9]  Mark Harman,et al.  Reformulating software engineering as a search problem , 2003 .

[10]  Jeremy Frank,et al.  When Gravity Fails: Local Search Topology , 1997, J. Artif. Intell. Res..

[11]  Wim Hordijk,et al.  A Measure of Landscapes , 1996, Evolutionary Computation.

[12]  Joachim Wegener,et al.  Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System , 2004, GECCO.

[13]  Roy P. Pargas,et al.  Test‐data generation using genetic algorithms , 1999 .

[14]  M. Dorigo,et al.  Algodesk : an experimental comparison of eight evolutionary heuristics applied to the Quadratic Assignment Problem , 1995 .

[15]  P. Stadler,et al.  The landscape of the traveling salesman problem , 1992 .

[16]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[17]  Anton V. Eremeev,et al.  On Confidence Intervals for the Number of Local Optima , 2003, EvoWorkshops.

[18]  Vassilis Zissimopoulos,et al.  Autocorrelation Coefficient for the Graph Bipartitioning Problem , 1998, Theor. Comput. Sci..

[19]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[20]  Bryan F. Jones,et al.  Structural performance measure of evolutionary testing applied to worst-case timing of real-time systems , 2000, IEE Proc. Softw..

[21]  Jin-Kao Hao,et al.  An Analysis of the Configuration Space of the Maximal Constraint Satisfaction Problem , 2000, PPSN.

[22]  Nigel James Tracey,et al.  A search-based automated test-data generation framework for safety-critical software , 2000 .

[23]  Joachim Wegener,et al.  Testing Temporal Correctness of Real-Time Systems — A New Approach Using Genetic Algorithms and Cluster Analysis — , 1999 .

[24]  Werner Ebeling,et al.  The Density of States - A Measure of the Difficulty of Optimisation Problems , 1996, PPSN.

[25]  Hélène Waeselynck,et al.  Property-oriented testing: a strategy for exploring dangerous scenarios , 2003, SAC '03.

[26]  Joachim Wegener,et al.  Test-Goal-Specific Termination Criteria for Evolutionary White-Box Testing by Means of Software Measures , 2005 .

[27]  Hélène Waeselynck,et al.  An empirical investigation of simulated annealing applied to property-oriented testing , 2003 .

[28]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[29]  Joachim Wegener,et al.  Testing real-time systems using genetic algorithms , 1997, Software Quality Journal.

[30]  Julian F. Miller,et al.  Genetic and Evolutionary Computation Conference 2008 : GECCO 2008 , 2008, GECCO 2008.

[31]  Egon Börger,et al.  Formal methods for industrial applications : specifying and programming the steam boiler control , 1996 .

[32]  Gary McGraw,et al.  Generating Software Test Data by Evolution , 2001, IEEE Trans. Software Eng..

[33]  Leonardo Vanneschi,et al.  Fitness Distance Correlation in Structural Mutation Genetic Programming , 2003, EuroGP.

[34]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[35]  Mark Harman,et al.  Search-based software engineering , 2001, Inf. Softw. Technol..

[36]  Egon Börger,et al.  Formal Methods for Industrial Applications , 1996, Lecture Notes in Computer Science.

[37]  Phil McMinn,et al.  Search‐based software test data generation: a survey , 2004, Softw. Test. Verification Reliab..

[38]  Thomas E. Vollmann,et al.  An Experimental Comparison of Techniques for the Assignment of Facilities to Locations , 1968, Oper. Res..

[39]  John A. Clark,et al.  An automated framework for structural test-data generation , 1998, Proceedings 13th IEEE International Conference on Automated Software Engineering (Cat. No.98EX239).

[40]  John A. Clark,et al.  Automated test‐data generation for exception conditions , 2000 .

[41]  E. Weinberger,et al.  Correlated and uncorrelated fitness landscapes and how to tell the difference , 1990, Biological Cybernetics.

[42]  Jin-Kao Hao,et al.  SAT, Local Search Dynamics and Density of States , 2001, Artificial Evolution.

[43]  Eugene Miya,et al.  On "Software engineering" , 1985, SOEN.

[44]  Bryan F. Jones,et al.  Automatic structural testing using genetic algorithms , 1996, Softw. Eng. J..

[45]  Vassilis Zissimopoulos,et al.  On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient , 2000, Discret. Appl. Math..

[46]  Joachim Wegener,et al.  Automatic Test Data Generation For Structural Testing Of Embedded Software Systems By Evolutionary Testing , 2002, GECCO.

[47]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .