Krakatoa: Decompilation in Java (does bytecode reveal source?)

Proceedings of the 3rd USENIX Conference on Object-Oriented Technologies, COOTS 1997

Volumn , Issue , 1997, Pages

  Proebsting, Todd A ^a   Watterson, Scott A ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BYTECODES; CODE REWRITING; DECOMPILATION; HIGH LEVEL CONTROL; JAVA BYTE CODES; JAVA SOURCE; SOURCE LEVEL;

EID: 84944201230     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. J.R. Allen, Ken Kennedy, Carrie Porterfield, and Joe Warren. Conversion of control dependence to data de- pendence. pages 177{189, 1983
2. E. Ashcroft and Z. Manna. Translating programs schemas to while-schemas. SIAM Journal of Computing, 4(2):125-146, 1975.
3. Zahira Ammarguellat. A control-flow normalization algorithm and its complexity. IEEE Transactions on Software Engineering, 18(2):237-250,1992.
4. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, Massachusetts, 1986.
5. Brenda S. Baker. An algorithm for structuring flowgraphs. Journal of the Association for Computing Machinery, 24(1):98-120, January 1977.
6. Cristina Cifuentes. A structuring algorithm for decompilation. In Proceedings of the XIX Conferencia Latinoamericana de Informatica, pages 267-276, Buenos Aires, Argentina, August 1993.
7. Ana M. Erosa and Laurie J. Hendren. Taming control flow: A structured approach to eliminating goto statements. pages 229-240. International Conference on Computer Languages, May 1994.
8. Ulrike Lichtblau. Decompilation of control structures by means of graph transformations. In C. F. M. Ni-vat Hartmut Ehrig and J. Thatcher, editors, Mathematical foundations of software development: Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT 85): volume 1 - Colloquium on Trees in Algebra and Programming (CAAP '85), volume 185 of Lecture Notes in Computer Science, pages 284-297. Springer-Verlag, March 1985.
9. Tim Lindholm and Frank Yellin. The Java Virtual Machine Specification. The Java Series. Addison-Wesley, 1997.
10. W.W. Peterson, T. Kasami, and N. Tokura. On the capabilities of while, repeat and exit statements. Communications of the ACM, 16(8):503-512, 1973.
11. Lyle Ramshaw. Eliminating go to's while preserving program structure. Journal of the Association for Computing Machinery, 35(4):893-920, October 1988.
12. KB Sriram. Hashjava. url: http://www.sbktech.org/hashjava.html, 1996.
13. Hanpeter van Vliet. Mocha. current url: http://www.brouhaha.com/~eric/ computers/mocha-b1.zip, 1996.
14. M.H. Williams. Generating structured flow diagrams: The nature of unstructuredness. Computer Journal, 20(1):45-50, 1977.
15. U. G. Wilhelm. Cryptographically protected objects, May 1997. A french version appeared in the Proceedings of RenPar'9, Lausanne, CH. http://lsewww.epfl.ch/~wilhelm/CryPO.html.
16. M.H. Williams and H.L. Ossher. Conversion of unstructured flow diagrams to structured. Computer Journal, 21(2):161-167, 1978.