Automatically Finding Patches Using Genetic Programming

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

@InProceedings{Weimer:2009:ICES,
  author =       "Westley Weimer and ThanhVu Nguyen and 
                 Claire {Le Goues} and Stephanie Forrest",
  title =        "Automatically Finding Patches Using Genetic
                 Programming",
  booktitle =    "International Conference on Software Engineering
                 (ICSE) 2009",
  year =         "2009",
  editor =       "Stephen Fickas",
  pages =        "364--374",
  address =      "Vancouver",
  month =        may # " 16-24",
  keywords =     "genetic algorithms, genetic programming",
  isbn13 =       "978-1-4244-3453-4",
  URL =          "http://www.cs.unm.edu/~tnguyen/papers/genprog.pdf",
  URL =          "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.8995",
  URL =          "http://www.cs.virginia.edu/~csl9q/docs/legoues-icse2009-genprog-preprint.pdf",
  DOI =          "doi:10.1109/ICSE.2009.5070536",
  size =         "11 pages",
  language =     "en",
  oai =          "oai:CiteSeerXPSU:10.1.1.147.8995",
  abstract =     "Automatic repair of programs has been a longstanding
                 goal in software engineering, yet debugging remains a
                 largely manual process. We introduce a fully automated
                 method for locating and repairing bugs in software. The
                 approach works on off-the-shelf legacy applications and
                 does not require formal specifications, program
                 annotations or special coding practices. Once a program
                 fault is discovered, an extended form of genetic
                 programming is used to evolve program variants until
                 one is found that both retains required functionality
                 and also avoids the defect in question. Standard test
                 cases are used to exercise the fault and to encode
                 program requirements. After a successful repair has
                 been discovered, it is minimized using structural
                 differencing algorithms and delta debugging. We
                 describe the proposed method and report results from an
                 initial set of experiments demonstrating that it can
                 successfully repair ten different C programs totaling
                 63,000 lines in under 200 seconds, on average.",
  notes =        "

                 slides
                 http://www.cs.uoregon.edu/events/icse2009/images/postPosters/Automatically%20Finding%20Patches%20Using%20Genetic%20Programming.pdf
                 ICSE best paper
                 http://www.cs.uoregon.edu/events/icse2009/home/

                 Winner The IFIP TC2 Manfred Paul Award for Excellence
                 in Software: Theory and Practice
                 http://www.cs.uoregon.edu/events/icse2009/awards/#ifip

                 Winner ACM SIGSOFT Distinguished Papers Award
                 http://www.sigsoft.org/awards/disPapAwd-rec.htm

                 Cf. \cite{DBLP:conf/gecco/ForrestNWG09} best paper
                 GECCO 2009.

                 Gold medal at 2009 HUMIES, GECCO.
                 http://www.genetic-programming.org/hc2009/cfe2009.html
                 http://www.genetic-programming.org/hc2009/1-Forrest/Forrest-Presentation.pdf

                 Listed on
                 http://automated-program-repair.org/bibliography.html",
}

Genetic Programming entries for Westley Weimer ThanhVu Nguyen Claire Le Goues Stephanie Forrest

Citations