Byte Code Genetic Programming

نویسندگان

  • Brad Harvey
  • James A. Foster
  • Deborah Frincke
چکیده

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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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 t...

متن کامل

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...

متن کامل

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...

متن کامل

A Technique for Fault Tolerance Assessment of COTS Based Systems

This paper investigates the feasibility of emulation of source code software faults directly in Java byte code. Experimental results show that software defects introduced in source code can be emulated in Java byte code with high level of confidence. This makes it possible to validate the dependability of Java programs with respect to realistic software defects embedded within used COTS compone...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998