Information flow analysis for Java bytecode

Lecture Notes in Computer Science

Volumn 3385, Issue , 2005, Pages 346-362

  Genaim, Samir ^a   Spoto, Fausto ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; BOOLEAN FUNCTIONS; GRAPH THEORY; INFORMATION ANALYSIS; MATHEMATICAL TRANSFORMATIONS;

BYTECODES; CONTROL FLOW GRAPHS; INFORMATION FLOW;

JAVA PROGRAMMING LANGUAGE;

EID: 24144440405     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30579-8_23     Document Type: Conference Paper

References (26)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers, Principles Techniques and Tools. Addison Wesley Publishing Company, 1986.
2. T. Amtoft and A. Banerjee. Information Flow Analysis in Logical Form. In R. Giacobazzi, editor, Proceedings of the Eleventh International Static Analysis Symposium (SAS), Lecture Notes in Computer Science, pages 100-115. Springer-Verlag, August 2004.
3. A. Banerjee and D. A. Naumann. Stack-based Access Control and Secure Information Flow. Journal of Functional Programming, Special issue on Language-based Security, to appear.
4. G. Barthe, A. Basu, and T. Rezk. Security Types Preserving Compilation. In VMCAI'04, volume 2937 of Lecture Notes in Computer Science. Springer-Verlag, 2004.
5. G. Barthe and T. Rezk. Secure Information Flow for a Sequential Java Virtual Machine. Unpublished.
6. C. Bodei, P. Degano, F. Nielson, and H. Nielson. Static Analysis for Secrecy and non-interference in Networks of Processes. In Proc. of PaCT'01, volume 2127 of Lecture Notes in Computer Science, pages 27-41. Springer-Verlag, 2001.
7. E. Bonelli, A. Compagnoni, and R. Medel. SIFTAL: A Typed Assembly Language for Secure Information Flow Analysis. Manuscript, 2004.
8. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, 35(8):677-691, 1986.
9. D. Clark, C. Hankin, and S. Hunt. Information Flow for ALGOL-like Languages. Computer Languages, 28(1):3-28, April 2002.
10. J. Dean, D. Grove, and C. Chambers. Optimization of Object-Oriented Programs using Static Class Hierarchy Analysis. In W. G. Olthoff, editor, Proc. of ECOOP'95, volume 952 of LNCS, pages 77-101, Århus, Denmark, August 1995. Springer-Verlag.
11. D. E. Denning. A Lattice Model of Secure Information Flow. Communications of the ACM, 19(5):236-242, 1976.
12. S. Genaim, R. Giacobazzi, and I. Mastroeni. Modeling Secure Information Flow with Boolean Functions. In P. Ryan, editor, WITS'04, April 2004.
13. S. Genaim and F. Spoto. Information flow analysis for Java bytecode. Extended Version.
14. N. Kobayashi and K. Shirane. Type-based Information Flow Analysis for Low-Level Languages. In 3rd Asian Workshop on Programming Languages and Systems, 2002.
15. P. Laud. Semantics and Program Analysis of Computationally Secure Information Flow. In Programming Languages and Systems, 10th European Symposium On Programming, ESOP, volume 2028 of Lecture Notes in Computer Science, pages 77-91. Springer-Ver lag, 2001.
16. J. Lind-Nielsen. BuDDy - A Binary Decision Diagram Package. Available at www.itu.dk/research/buddy/.
17. T. Lindholm and F. Yellin. The Java™ Virtual Machine Specification. Java™ Series. Addison-Wesley, 1999.
18. M. Mizuno. A Least Fixed Point Approach to Inter-Procedural Information Flow Control. In Proc. 12th NIST-NCSC National Computer Security Conference, pages 558-570, 1989.
19. J. Practical Mostly-Static Information Flow Control. Andrew c. myers. In 26th ACM Symposium on Principles of Programming Languages, pages 228-241, San Antonio, Texas, 1999.
20. A. Sabelfeld and A. Myers. Language-based Information-Flow Security. IEEE Journal on Selected Areas in Communications, 21(1):5-19, 2003.
21. A. Sabelfeld and D. Sands. A PER Model of Secure Information Flow in Sequential Programs. Higher-Order and Symbolic Computation, 14(1):59-91, 2001.
22. C. Skalka and S. Smith. Static Enforcement of Security with Types. In ICFP'00, pages 254-267. ACM press, 2000.
23. F. Spoto. The Julia Generic Static Analyser, www.sci.univr.it/~spoto/julia, 2004.
24. F. Spoto and T. Jensen. Class Analyses as Abstract Interpretations of Trace Semantics. ACM Transactions on Programming Languages and Systems (TOPLAS), 25(5):578-630, September 2003.
25. D. Volpano, G. Smith, and C. Irvine. A Sound Type System for Secure Flow Analysis. Journal of Computer Security, 4(2,3):167-187, 1996.
26. S. Zdancewic and A. C. Myers. Secure Information Flow and CPS. In D. Sands, editor, ESOP, volume 2028 of Lecture Notes in Computer Science, pages 46-61. Springer, 2001.