Exploring Fitness and Edit Distance of Mutated Python Programs
Genetic Improvement (GI) is the process of using computational search techniques to improve existing software e.g. in terms of execution time, power consumption or correctness. As in most heuristic search algorithms, the search is guided by fitness with GI searching the space of program variants of...
Saved in:
| Published in | Genetic Programming Vol. 10196; pp. 19 - 34 |
|---|---|
| Main Authors | , , , |
| Format | Book Chapter |
| Language | English |
| Published |
Switzerland
Springer International Publishing AG
2017
Springer International Publishing |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783319556956 3319556959 |
| ISSN | 0302-9743 1611-3349 |
| DOI | 10.1007/978-3-319-55696-3_2 |
Cover
| Summary: | Genetic Improvement (GI) is the process of using computational search techniques to improve existing software e.g. in terms of execution time, power consumption or correctness. As in most heuristic search algorithms, the search is guided by fitness with GI searching the space of program variants of the original software. The relationship between the program space and fitness is seldom simple and often quite difficult to analyse. This paper makes a preliminary analysis of GI’s fitness distance measure on program repair with three small Python programs. Each program undergoes incremental mutations while the change in fitness as measured by proportion of tests passed is monitored. We conclude that the fitnesses of these programs often does not change with single mutations and we also confirm the inherent discreteness of bug fixing fitness functions. Although our findings cannot be assumed to be general for other software they provide us with interesting directions for further investigation. |
|---|---|
| ISBN: | 9783319556956 3319556959 |
| ISSN: | 0302-9743 1611-3349 |
| DOI: | 10.1007/978-3-319-55696-3_2 |