- author = "Kiran Lakhotia",
- title = "{En Garde:} Winning Coding Duels Through Genetic Programming",
- booktitle = "Sixth IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW 2013)",
- year = "2013",
- editor = "Tanja Vos and Simon Poulding",
- pages = "421--424",
- address = "Luxembourg",
- month = "22 " # mar,
- publisher = "IEEE",
- note = "Refereed Fast Abstract",
- keywords = "genetic algorithms, genetic programming, SBSE, PEX, .NET",
- isbn13 = "978-1-4799-1324-4",
-
URL = "
http://www.cs.ucl.ac.uk/staff/K.Lakhotia/docs/sbst2013-fast.pdf",
-
DOI = "
doi:10.1109/ICSTW.2013.79",
- size = "4 pages",
- abstract = "In this paper we present a Genetic Programming system to solve coding duels on the Pex4Fun website http://www.pexforfun.com/ Users create simple puzzle methods in a .NET supported programming language, and other users have to guess the puzzle implementation through trial and error. We have replaced the human user who solves a puzzle (i.e. implements a program that matches the implementation of the puzzle) with a Genetic Programming system that tries to win such coding duels. During a proof of concept experiment we found that our system can indeed automatically generate code that matches the behaviour of a secret puzzle method. It takes on average 77 fitness evaluations to succeed.",
-
notes = "Held in conjunction with ICST 2013 - IEEE
International Conference on Software Testing,
Verification and Validation
http://www.pexforfun.com/ broken May 2022
http://www.searchbasedsoftwaretesting.org/2013/ Also known as \cite{6571664}",
