Automatic programming and program maintenance with genetic programming

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

@Article{petry:1995:appm,
  author =       "Frederick E. Petry and Bertrand Daniel Dunay",
  title =        "Automatic programming and program maintenance with
                 genetic programming",
  journal =      "International Journal of Software Engineering and
                 Knowledge Engineering",
  year =         "1995",
  volume =       "5",
  number =       "2",
  pages =        "165--177",
  keywords =     "genetic algorithms, genetic programming, SBSE, machine
                 learning, encapsulation, software reuse, software
                 maintenance",
  URL =          "http://www.worldscinet.com/ijseke/05/preserved-docs/0502/S0218194095000095.pdf",
  DOI =          "doi:10.1142/S0218194095000095",
  abstract =     "Automatic programming is discussed in the context of
                 software engineering. An approach to automatic
                 programming is presented, which uses software
                 engineering principles in the synthesis and maintenance
                 of programs. As a simple demonstration,
                 program-equivalent Turing machines are synthesised,
                 encapsulated, reused, and maintained by genetic
                 programming.

                 Turing machines are synthesized from input-output pairs
                 for a variety of simple problems. When a problem is
                 solved, the solution is encapsulated and becomes part
                 of a software library. The genetic program uses the
                 library to solve new problems by combining library
                 components with program primitives to synthesise new
                 programs. When a new problem is solved or a known
                 problem is solved more efficiently, the genetic program
                 maintains the library so as to keep it valid and
                 efficient.",
  notes =        "

                 Simple demonstration (NB series of regular languages)
                 Turing machines are synthesised, encapsulated, reused.
                 Library of evolved TM is created. Library programs can
                 be used by other problems. The library is maintained by
                 replacing programs if new and better versions of TM it
                 contains are evolved so its contents are kept valid.",
}

Genetic Programming entries for Frederic E Petry Bertrand Daniel Dunay

Citations