Generation of tests for programming challenge tasks using evolution algorithms.

Research output: Chapter in Book/Report/Conference proceedingConference Proceeding (Non-Journal item)

Abstract

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.
Original languageEnglish
Title of host publicationGECCO '11
Subtitle of host publicationProceedings of the 13th annual conference companion on Genetic and evolutionary computation
EditorsNatalio Krasnogor
PublisherAssociation for Computing Machinery
Pages763-766
Number of pages4
ISBN (Print)9781450306904, 145030690X
DOIs
Publication statusPublished - 12 Jul 2011
Externally publishedYes
EventGECCO 2011: The Genetic and Evolutionary Computation Conference - Ireland, United Kingdom of Great Britain and Northern Ireland
Duration: 12 Jul 201116 Jul 2011

Conference

ConferenceGECCO 2011: The Genetic and Evolutionary Computation Conference
Country/TerritoryUnited Kingdom of Great Britain and Northern Ireland
CityIreland
Period12 Jul 201116 Jul 2011

Keywords

  • genetic algorithms
  • programming challenges
  • testing

Fingerprint

Dive into the research topics of 'Generation of tests for programming challenge tasks using evolution algorithms.'. Together they form a unique fingerprint.

Cite this