We present a flow and context sensitive compositional information flow analysis for full (mono-threaded) Java bytecode. We base our analysis on the transformation of the Java bytecode into a control-flow graph of basic blocks of code which makes explicit the complex features of the Java bytecode. We represent information flows through Boolean functions and hence implement an accurate and efficient information flow analysis through binary decision diagrams. To the best of our knowledge, it is the first one for full Java bytecode.
|Titolo:||Information Flow Analysis for Java Bytecode|
|Data di pubblicazione:||2005|
|Appare nelle tipologie:||04.01 Contributo in atti di convegno|