Generation of tests for programming challenge tasks using evolution algorithms.

Maxim Buzdalov

doi:10.1145/2001858.2002086

Generation of tests for programming challenge tasks using evolution algorithms.

Maxim Buzdalov

ITMO University

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion Cynhadledd › Trafodion Cynhadledd (Nid-Cyfnodolyn fathau)

10 Dyfyniadau (Scopus)

Crynodeb

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.

Iaith wreiddiol	Saesneg
Teitl	GECCO '11
Is-deitl	Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Golygyddion	Natalio Krasnogor
Cyhoeddwr	Association for Computing Machinery
Tudalennau	763-766
Nifer y tudalennau	4
ISBN (Argraffiad)	9781450306904, 145030690X
Dynodwyr Gwrthrych Digidol (DOIs)	https://doi.org/10.1145/2001858.2002086
Statws	Cyhoeddwyd - 12 Gorff 2011
Cyhoeddwyd yn allanol	Ie
Digwyddiad	GECCO 2011: The Genetic and Evolutionary Computation Conference - Ireland, Teyrnas Unedig Prydain Fawr a Gogledd Iwerddon Hyd: 12 Gorff 2011 → 16 Gorff 2011

Cynhadledd

Cynhadledd	GECCO 2011: The Genetic and Evolutionary Computation Conference
Gwlad/Tiriogaeth	Teyrnas Unedig Prydain Fawr a Gogledd Iwerddon
Dinas	Ireland
Cyfnod	12 Gorff 2011 → 16 Gorff 2011

Mynediad at Ddogfen

10.1145/2001858.2002086

Cysylltiad parhaol

Dolen barhaus

Ffeiliau eraill a chysylltiadau

https://www.scopus.com/record/display.uri?eid=2-s2.0-80051944883&origin=resultslist

Dyfynnu hyn

@inproceedings{09bc696e1788407a9cb57e5c46282894,

title = "Generation of tests for programming challenge tasks using evolution algorithms.",

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.",

keywords = "genetic algorithms, programming challenges, testing",

author = "Maxim Buzdalov",

year = "2011",

month = jul,

day = "12",

doi = "10.1145/2001858.2002086",

language = "English",

isbn = "9781450306904",

pages = "763--766",

editor = "Natalio Krasnogor",

booktitle = "GECCO '11",

publisher = "Association for Computing Machinery",

address = "United States of America",

note = "GECCO 2011: The Genetic and Evolutionary Computation Conference ; Conference date: 12-07-2011 Through 16-07-2011",

}

Buzdalov, M 2011, Generation of tests for programming challenge tasks using evolution algorithms. yn N Krasnogor (gol.), GECCO '11: Proceedings of the 13th annual conference companion on Genetic and evolutionary computation. Association for Computing Machinery, tt. 763-766, GECCO 2011: The Genetic and Evolutionary Computation Conference, Ireland, Teyrnas Unedig Prydain Fawr a Gogledd Iwerddon, 12 Gorff 2011. https://doi.org/10.1145/2001858.2002086

Generation of tests for programming challenge tasks using evolution algorithms. / Buzdalov, Maxim.
GECCO '11: Proceedings of the 13th annual conference companion on Genetic and evolutionary computation. gol. / Natalio Krasnogor. Association for Computing Machinery, 2011. t. 763-766.

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion Cynhadledd › Trafodion Cynhadledd (Nid-Cyfnodolyn fathau)

TY - GEN

T1 - Generation of tests for programming challenge tasks using evolution algorithms.

AU - Buzdalov, Maxim

PY - 2011/7/12

Y1 - 2011/7/12

N2 - 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.

AB - 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.

KW - genetic algorithms

KW - programming challenges

KW - testing

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-80051944883&origin=resultslist

U2 - 10.1145/2001858.2002086

DO - 10.1145/2001858.2002086

M3 - Conference Proceeding (Non-Journal item)

SN - 9781450306904

SN - 145030690X

SP - 763

EP - 766

BT - GECCO '11

A2 - Krasnogor, Natalio

PB - Association for Computing Machinery

T2 - GECCO 2011: The Genetic and Evolutionary Computation Conference

Y2 - 12 July 2011 through 16 July 2011

ER -

Generation of tests for programming challenge tasks using evolution algorithms.

Crynodeb

Cynhadledd

Mynediad at Ddogfen

Cysylltiad parhaol

Ffeiliau eraill a chysylltiadau

Ôl bys

Dyfynnu hyn