Information Flow Analysis for Java Bytecode

12 years 3 months ago
Information Flow Analysis for Java Bytecode
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode into a control-flow graph of basic blocks of code such that the complex features of the Java bytecode made explicit. The analysis is based on modeling the information flow dependencies with Boolean functions which leads to an accurate analysis and efficient implementation which uses Binary Decision Diagrams to manipulate Boolean functions. To the best of our knowledge, it is the first implementation of an analysis of information flow for the full Java bytecode. The work is still in progress but it is already support a quite large portion of the Java bytecode which includes exceptions and the subroutine handling mechanism.
Samir Genaim, Fausto Spoto
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Authors Samir Genaim, Fausto Spoto
Comments (0)