• Home
  • Search
  • Information Flow Analysis for Java Bytecode
  • Cite Icon80
  • https://doi.org/10.1007/978-3-540-30579-8_23Copy DOI Icon

Information Flow Analysis for Java Bytecode

  • Jan 1, 2005
  • Samir Genaim +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
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.KeywordsBoolean FunctionBasic BlockExecution TraceBinary Decision DiagramCovert ChannelThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Similar Papers
  • Research Article
  • Citations1

Delay testable logical circuit design

  • Apr 01, 2013
  • Russian Physics Journal
  • A Yu Matrosova +2
  • Conference Article
  • Citations36

Towards scalable flow and context sensitive pointer analysis

  • Jan 01, 2005
  • Jianwen Zhu
  • Research Article
  • Citations65

On the size of binary decision diagrams representing Boolean functions

  • Jul 01, 1995
  • Theoretical Computer Science
  • Y Breitbart +2
  • Book Chapter
  • Citations6

The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions

  • Jan 01, 1994
  • Ingo Wegener
  • Research Article
  • Citations49

A Genetic Algorithm (GA) and Swarm-Based Binary Decision Diagram (BDD) Reordering Optimizer Reinforced With Recent Operators

  • Jun 01, 2023
  • IEEE Transactions on Evolutionary Computation
  • Ahmed Awad +2
  • Research Article
  • Citations2

ROBDD complexity analysis for XOR/XNOR min-terms

  • Feb 01, 2008
  • International Journal of Electronics
  • P W C Prasad +2
  • Conference Article
  • Citations8

Comparison of Left Fold and Tree Fold Strategies in Creation of Binary Decision Diagrams

  • Jun 22, 2021
  • Michal Mrena +1
  • Research Article
  • Citations4

Chain Reduction for Binary and Zero-Suppressed Decision Diagrams

  • Jul 21, 2020
  • Journal of Automated Reasoning
  • Randal E Bryant
  • PDF
  • Book Chapter
  • Citations17

Chain Reduction for Binary and Zero-Suppressed Decision Diagrams

  • Jan 01, 2018
  • Randal E Bryant
  • Conference Article
  • Citations135

A logic for information flow in object-oriented programs

  • Jan 11, 2006
  • Torben Amtoft +2
  • Research Article
  • Citations27

A logic for information flow in object-oriented programs

  • Jan 11, 2006
  • ACM SIGPLAN Notices
  • Torben Amtoft +2
  • Research Article
  • Citations12

Ordered binary decision diagrams and minimal trellises

  • Jan 01, 1999
  • IEEE Transactions on Computers
  • J Lafferty +1
  • Research Article
  • Citations13

On the Relative Succinctness of Sentential Decision Diagrams

  • Dec 10, 2018
  • Theory of Computing Systems
  • Beate Bollig +1
  • Book Chapter
  • Citations2

Blockwise variable orderings for shared BDDs

  • Jan 01, 1998
  • Harry Preuß +1
  • Research Article
  • Citations6

On the error resilience of ordered binary decision diagrams

  • Jun 09, 2015
  • Theoretical Computer Science
  • Anna Bernasconi +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.