Towards Byte Code Genetic Programming
نویسندگان
چکیده
We investigate using the GP paradigm to evolve linear genotypes (individuals) that consist of Java byte code. Our prototype GP system (bcGP) is implemented in Java. The evolutionary process is done completely in memory and the fitness of individuals is determined by directly executing them in the Java Virtual Machine (JVM). Our scheme is an effective means for evolving native machine code for the JVM.
منابع مشابه
Byte Code Genetic Programming
This paper explores the idea of using Genetic Programming (GP) to evolve Java Virtual Machine (JVM) byte code to solve a sample symbolic regression problem. The evolutionary process is done completely in memory using a standard Java environment.
متن کاملNibbling Java Byte Code for Resource-Critical Devices
This work describes a method that makes the Java instruction as small as possible. The proposed method, called "nibble coding", compresses two instructions into one byte. The experiment is carried out to compare Java byte code instruction and a modified code with the nibble coding. The result shows the proposed scheme achieves a much smaller instruction bandwidth than the ordinary byte-code cou...
متن کاملGenerating Eecient Stack Code for Java
Optimizing Java byte code is complicated by the fact that it uses a stack-based execution model. Changing the intermediate representation from the stack-based to the register-based one brings the problem of Java byte code optimizations into well-studied domain of compiler optimizations for register-based codes. In this paper we describe the technique to convert a register-based code into the Ja...
متن کاملPartial Translation: towards a Portable and Eecient Prolog Implementation Technology
We describe a new language translation framework (partial translation) and the application of one of its instances: the C-iication of Binary Prolog. Our partial translation framework compiles selected sequences of em-ulator instructions down to native code. The technique can be seen as an automatic specialization with respect to a given program of the traditional instruction folding techniques ...
متن کاملEvolving Turing-Complete Programs for a Register Machine with Self-modifying Code
The majority of commercial computers today are register machines of von Neumann type. We have developed a method to evolve Turing-complete programs for a register machine. The described implementation enables the use of most program constructs, such as arithmetic operators, large indexed memory, automatic decomposition into subfunctions and subroutines (ADFs), conditional constructs i.e. if-the...
متن کامل