![]() Volpano, D., Smith, G., Irvine, C.: A Sound Type System for Secure Flow Analysi. ACM Transactions on Programming Languages and Systems (TOPLAS) 25(5), 578–630 (2003) Spoto, F., Jensen, T.: Class Analyses as Abstract Interpretations of Trace Semantics. Spoto, F.: The Julia Generic Static Analyser (2004), Skalka, C., Smith, S.: Static Enforcement of Security with Types. Sabelfeld, A., Sands, D.: A PER Model of Secure Information Flow in Sequential Programs. IEEE Journal on Selected Areas in Communications 21(1), 5–19 (2003) Sabelfeld, A., Myers, A.: Language-based Information-Flow Security. In: 26th ACM Symposium on Principles of Programming Languages, San Antonio, Texas, pp. Practical Mostly-Static Information Flow Control. 12th NIST-NCSC National Computer Security Conference, pp. Mizuno, M.: A Least Fixed Point Approach to Inter-Procedural Information Flow Control. Lindholm, T., Yellin, F.: The Java TM Virtual Machine Specification. Lind-Nielsen, J.: BuDDy - A Binary Decision Diagram Package, Available at Laud, P.: Semantics and Program Analysis of Computationally Secure Information Flow. In: 3rd Asian Workshop on Programming Languages and Systems (2002) Kobayashi, N., Shirane, K.: Type-based Information Flow Analysis for Low-Level Languages. Genaim, S., Spoto, F.: Information flow analysis for java bytecode. Genaim, S., Giacobazzi, R., Mastroeni, I.: Modeling Secure Information Flow with Boolean Functions. Springer, Heidelberg (1995)ĭenning, D.E.: A Lattice Model of Secure Information Flow. Computer Languages 28(1), 3–28 (2002)ĭean, J., Grove, D., Chambers, C.: Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis. IEEE Transactions on Computers 35(8), 677–691 (1986)Ĭlark, D., Hankin, C., Hunt, S.: Information Flow for ALGOL-like Languages. Manuscript (2004)īryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. Springer, Heidelberg (2001)īonelli, E., Compagnoni, A., Medel, R.: SIFTAL: A Typed Assembly Language for Secure Information Flow Analysis. Springer, Heidelberg (2004)īarthe, G., Rezk, T.: Secure Information Flow for a Sequential Java Virtual Machine (unpublished)īodei, C., Degano, P., Nielson, F., Riis Nielson, H.: Static Analysis for Secrecy and non-Interference in Networks of Processes. Journal of Functional Programming, Special issue on Language-based Security (to appear)īarthe, G., Basu, A., Rezk, T.: Security Types Preserving Compilation. Springer, Heidelberg (2004)īanerjee, A., Naumann, D.A.: Stack-based Access Control and Secure Information Flow. Addison Wesley Publishing Company, Reading (1986)Īmtoft, T., Banerjee, A.: Information Flow Analysis in Logical Form. In pathological cases, the best you can do is create a seperate try catch for every instruction that throws and repeat the process above.Aho, A.V., Sethi, R., Ullman, J.D.: Compilers, Principles Techniques and Tools. At the bytecode level, exception handlers are basically another form of goto. Java requires all exception handling to be done through structured try/catch blocks and it's variations while bytecode doesn't. ![]() It is impossible to turn into Java without changing the structure or duplicating part of the code (though in this case, there are no actual statements so duplicating wouldn't be so bad). ![]() This is the simplest possible irreducible loop. The other approach is to turn the method into a while-switch state machine, but this obscures the original control flow.Īn example instruction sequence is ifnull 元 ![]() My preferred solution is to duplicate part of the loop body, though this can lead to exponential blow up in pathological cases as well. An "irreducible" loop is one that has multiple distinct entry points, and hence no direct Java equivalent. Irreducible loops - In Java, every loop has a single entry point which dominates the rest of the loop. However, this will lead to an exponential increase in code size if they are nested. JSR/RET - this instruction pairs has no equivalent in Java. There are several reasons why bytecode control flow may not be translatable back into Java without extreme measures. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |