Created by W.Langdon from gp-bibliography.bib Revision:1.8028
We investigate mutation-based approaches for highlighting where a performance improvement is likely to exist. For all modification locations in a program, we make all possible modifications and analyse how often modifications reduce execution count. We compare the resulting code location rankings against rankings derived using a profiler and find that mutation analysis provides the higher accuracy in highlighting performance improvement locations in a set of benchmark problems, though at a much higher execution cost. We see both approaches as complimentary and consider how they may be used to further guide Genetic Programming in finding performance improvements",
https://github.com/codykenb/locoGP https://codykenb.github.io/locoGP/locoGP-ImprovementsFound.html
GI-2018 http://geneticimprovementofsoftware.com/events/papers#icse2018 part of \cite{Petke:2018:ICSEworkshop}",
Genetic Programming entries for Brendan Cody-Kenny Michael O'Neill Stephen Barrett