Parallel Program Analysis for Linear Genetic Programming

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

@InProceedings{Langdon:2026:UKCI,

• author = "William B. Langdon",
• title = "Parallel Program Analysis for Linear Genetic Programming",
• booktitle = "25th UK Workshop on Computational Intelligence (UKCI 2026)",
• year = "2026",
• address = "Coventry University",
• month = "9--11 " # sep,
• keywords = "genetic algorithms, genetic programming, Genetic Improvement, deadcode removal, automatic simplification, software optimisation, slicing, evolutionary computing, SBSE, search based software engineering, optimisation",
• URL = "https://solar.cs.ucl.ac.uk/pdf/Langdon_2026_UKCI.pdf",
• code_url = "https://github.com/wblangdon/GPengine",
• size = "12 pages",
• abstract = "Removing unnecessary instructions is commonly performed in a sequential single backward slice through the whole program from the output to its inputs. By keeping track of all registers the program can be broken into 100 or more sections which can each be simplified in parallel. In large evolved linear genetic programming (GP) programs the reduction in intron anti-bloat removal overhead (9.7 fold) can exceed the time to interpret the program, giving effective speeds of up to 726 billion GP operations/second (726 GigaGPOP/s).",
• notes = "https://ukci2026.coventry.ac.uk/",

}

Genetic Programming entries for William B Langdon

Citations