En Garde: Winning Coding Duels Through Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.2469

@InProceedings{Lakhotia:2013:SBST,
  author =       "Kiran Lakhotia",
  title =        "{En Garde:} Winning Coding Duels Through Genetic
                 Programming",
  booktitle =    "6th International Workshop on Search-Based Software
                 Testing (SBST 2013)",
  year =         "2013",
  editor =       "Tanja Vos and Simon Poulding",
  address =      "Luxembourg",
  month =        "22 " # mar,
  note =         "Refereed Fast Abstract",
  keywords =     "genetic algorithms, genetic programming, SBSE, PEX,
                 .NET",
  URL =          "http://www.cs.ucl.ac.uk/staff/K.Lakhotia/docs/sbst2013-fast.pdf",
  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-users.cs.york.ac.uk/~smp/sbst2013/",
}

Genetic Programming entries for Kiran Lakhotia