Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 346-362 |
| Number of pages | 17 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3385 |
| DOIs | |
| State | Published - 1 Jan 2005 |
| Externally published | Yes |
| Event | 6th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2005 - Paris, France Duration: 17 Jan 2005 → 19 Jan 2005 |
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science