@InProceedings{kuhling:2002:EuroGP,
title = "Brute-Force Approach to Automatic Induction of Machine
Code on {CISC} Architectures",
author = "Felix K{\"u}hling and Krister Wolff and Peter Nordin",
editor = "James A. Foster and Evelyne Lutton and
Julian Miller and Conor Ryan and Andrea G. B. Tettamanzi",
booktitle = "Genetic Programming, Proceedings of the 5th European
Conference, EuroGP 2002",
volume = "2278",
series = "LNCS",
pages = "288--297",
publisher = "Springer-Verlag",
address = "Kinsale, Ireland",
publisher_address = "Berlin",
month = "3-5 " # apr,
year = "2002",
keywords = "genetic algorithms, genetic programming, CISC",
ISBN = "3-540-43378-3",
DOI = "doi:10.1007/3-540-45984-7_28",
abstract = "The usual approach to address the brittleness of
machine code in evolution is to constrain mutation and
crossover to ensure syntactic closure. In the novel
approach presented here we use no constraints on the
operators, they all work blindly on the binaries in
memory, but we instead encapsulate the code and trap
all resulting exceptions. The new approach presented
here for machine code evolution on CISC architectures
is based on the observation that modern CPUs can cope
with incorrect programmes and report errors to the
operating system. This way it is possible to return to
very simple genetic operators with the objective of
increased performance. Furthermore the instruction set
used by evolved programmes is no longer limited by the
genetic programming system but only by the CPU it runs
on. The mapping between evolution platform and
execution platform becomes almost complete, ensuring
correct low-level behaviour of all CPU functions.",
notes = "EuroGP'2002, part of \cite{lutton:2002:GP}",
}