Created by W.Langdon from gp-bibliography.bib Revision:1.8620
http://www.cs.ucl.ac.uk/staff/W.Langdon/gecco2022/gi2022/papers/Chuengsatiansup_2022_GI.pdf",
10.1145/3520304.3534049",
http://geneticimprovementofsoftware.com/slides/gi2022gecco/chuengsatiansup-opportunities-for-genetic-gi-gecco-22.pdf",
https://www.youtube.com/watch?v=3xD2zgucpug&list=PLI8fiFpB7BoIHgl5CsdtjfWvHlE5N6pje&index=4",
http://geneticimprovementofsoftware.com/events/gecco2022
Constant-time programming, masking. NIST P-256-mul
cites \cite{KriFeeleyQEST04}, Rosita \cite{Shelton:2021:NDSS} and \cite{DBLP:conf/vstte/BosamiyaGLPH20}.
'We start with an abstract representation of the code as a data flow graph'. 'register to spill to memory'. speed up upto 2.5 times faster. Hillclimb. Mutation takes advantage of reordering x86 instructions.
GECCO-2022 A Recombination of the 31st International Conference on Genetic Algorithms (ICGA) and the 27th Annual Genetic Programming Conference (GP)",
Genetic Programming entries for Chitchanok Chuengsatiansup Markus Wagner Yuval Yarom