论文信息 - Generation of tests for programming challenge tasks using evolution algorithms

Generation of tests for programming challenge tasks using evolution algorithms

In this paper, an automated method for generation of tests in order to detect inefficient (slow) solutions for programming challenge tasks is proposed. The method is based on genetic algorithms. The proposed method was applied to a task from the Internet problem archive - the Timus Online Judge. For this problem, none of the existed solutions passed the generated set of tests.

Maxim Buzdalov | M. Buzdalov

[1] Kent L. Beck,et al. Extreme programming explained - embrace change , 1990 .

[2] S. Reid. The Art of Software Testing, Second edition. Glenford J. Myers. Revised and updated by Tom Badgett and Todd M. Thomas, with Corey Sandler. John Wiley and Sons, New Jersey, U.S.A., 2004. ISBN: 0-471-46912-2, pp 234: Book Reviews , 2005 .

[3] David Pisinger,et al. Algorithms for Knapsack Problems , 1995 .

[4] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[5] Rob Kolstad. The International Olympiad on Informatics , 2009, login Usenix Mag..

[6] David Pisinger,et al. Where are the hard knapsack problems? , 2005, Comput. Oper. Res..

[7] S. Martello,et al. Algorithms for Knapsack Problems , 1987 .

[8] Paolo Tonella,et al. Evolutionary testing of classes , 2004, ISSTA '04.

[9] Glenford J. Myers,et al. Art of Software Testing , 1979 .

[10] ACM International Collegiate Programming Contest , 2006 .

[11] Steven Skiena,et al. Programming challenges: the programming contest training manual , 2003, SIGA.

[12] Dorothea Heiss-Czedik,et al. An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[13] Timo Mantere,et al. Genetic Algorithm Based Software Testing , 1997, ICANNGA.