Backward range simulation of Java bytecodes and reduction of its processing time

In this paper we introduce a backward simulation of machine code program and report results of reduction methods of its processing time. It may be efficient to analyze a program by tracing back from the final result for detecting all the bugs caused by some codes in the program. We describe the backward simulator of Java bytecode program and methods of processing time reduction such as range division, stepwise resolution improvement, setting of search path, and exponential range division. Results of two short programs and effects of reduction methods are shown.