%0 Journal Article %1 petry:1995:appm %A Petry, Frederick E. %A Dunay, Bertrand Daniel %D 1995 %J International Journal of Software Engineering and Knowledge Engineering %K algorithms, encapsulation, genetic learning, machine maintenance programming reuse, software %N 2 %P 165--177 %R doi:10.1142/S0218194095000095 %T Automatic programming and program maintenance with genetic programming %U http://www.worldscinet.com/ijseke/05/preserved-docs/0502/S0218194095000095.pdf %V 5 %X 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.

@article{petry:1995:appm, 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.}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Petry, Frederick E. and Dunay, Bertrand Daniel}, biburl = {https://www.bibsonomy.org/bibtex/2089ad4bd4ffb1e8d934e5162b033e287/brazovayeye}, doi = {doi:10.1142/S0218194095000095}, interhash = {b194dcb2e7f3b4690a627a955ea9eef3}, intrahash = {089ad4bd4ffb1e8d934e5162b033e287}, journal = {International Journal of Software Engineering and Knowledge Engineering}, keywords = {algorithms, encapsulation, genetic learning, machine maintenance programming reuse, software}, 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.}, number = 2, pages = {165--177}, timestamp = {2008-06-19T17:49:27.000+0200}, title = {Automatic programming and program maintenance with genetic programming}, url = {http://www.worldscinet.com/ijseke/05/preserved-docs/0502/S0218194095000095.pdf}, volume = 5, year = 1995 }