Using Execution Paths to Evolve Software Patches

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

@InProceedings{Nguyen:2009:SBST,
  author =       "ThanhVu Nguyen and Westley Weimer and 
                 Claire {Le Goues} and Stephanie Forrest",
  title =        "Using Execution Paths to Evolve Software Patches",
  booktitle =    "International Conference on Software Testing,
                 Verification and Validation Workshops, ICSTW '09",
  year =         "2009",
  editor =       "Phil McMinn and Robert Feldt",
  pages =        "152--153",
  address =      "Denver, Colorado, USA",
  month =        "1-4 " # apr,
  organisation = "EvoTest",
  keywords =     "genetic algorithms, genetic programming, SBSE, Zunebug
                 31 Dec 2008, SRGP, evolutionary approach, execution
                 path, minimization, program testing, search space
                 complexity, software patch, software repair, program
                 debugging, program diagnostics, program testing",
  URL =          "http://iaser.tek.bth.se/feldt/conferences/sbst09/papers/nguyen_sbst09.pdf",
  DOI =          "doi:10.1109/ICSTW.2009.35",
  size =         "2 pages",
  abstract =     "We present an evolutionary approach using Genetic
                 Programming (GP) to automatically create software
                 repairs. By concentrating the modifications on regions
                 related to where the bug occurs, we effectively
                 minimize the search space complexity and hence increase
                 the performance of the GP process. To preserve the core
                 functionalities of the program, we evolve programs only
                 from code in the original program. Early experimental
                 results show our GP approach is able to fix various
                 program defects in reasonable time.",
  notes =        "Best short paper and Best presentation awards!

                 Zero fitness if fail to compile or run time exceeds 5
                 seconds. SUS, 1-point crossover, md5sum. Structural
                 differencing algorithms. Delta debugging. Almost all
                 examples are C segmentation faults or infinite loops,
                 except atris.
                 Cil.

                 http://iaser.tek.bth.se/feldt/conferences/sbst09 In
                 conjunction with ICST 2009 IEEE International
                 Conference on Testing, Verification and Validation Also
                 known as \cite{4976381}",
}

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

Citations