Type Elaboration and Subtype Completion for Java Bytecode

ACM Transactions on Programming Languages and Systems

Volumn 23, Issue 2, 2001, Pages 243-272

  Knoblock, Todd B ^a   Rehof, Jakob ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

D.3.4 Programming Languages : Processors Compilers; F.3.3 Logics and Meanings of Programs : Studies of Program Constructs Type Structure; Java compiler; Languages; Lattice completion; Object oriented type systems; Theory; Type directed compilation

Indexed keywords

BYTECODES; TYPECHECKING;

BOOLEAN ALGEBRA; CODES (SYMBOLS); INFERENCE ENGINES; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS; SET THEORY; THEOREM PROVING;

JAVA PROGRAMMING LANGUAGE;

EID: 0346271752     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/383043.383045     Document Type: Article

References (46)

1. AÏT-KACI, H., BOYER, R., LINCOLN, P., AND NASR, R. 1989. Efficient implemenation of lattice operations. ACM Transactions on Programming Languages and Systems 11, 1 (January), 115-146.
2. BACON, D. F. 1997. Fast and effective optimization of statically typed object-oriented languages. Ph.D. thesis, U.C. Berkeley.
3. BENKE, M. 1993. Efficient type reconstruction in the presence of inheritance. In Mathematical Foundations of Computer Science (MFCS). Springer Verlag, LNCS 711, 272-280.
4. BIRKHOFF, G. 1995. Lattice Theory, third ed. Colloquium Publications, vol. 25. American Mathematical Society, Providence, RI.
5. CASEAU, Y. 1993. Efficient handling of multiple inheritance hierarchies. In Proceedings OOPSLA '93. Washington,DC,USA, 271-287.
6. COGLIO, A., GOLDBERG, A., AND QIAN, Z. 1998. Towards a provably-correct implementation of the JVM bytecode verifier. Tech. Rep. KES.U.98.5, Kestrel Institue. August 1998. Also availabe in Proceedings of the OOPSLA '98 Workshop on the Formal Underpinnings of Java, Vancouver, B.C., October 1998.
7. COGLIO, A., GOLDBERG, A., AND QIAN, Z. 1998. Towards a provably-correct implementation of the JVM bytecode verifier. Tech. Rep. KES.U.98.5, Kestrel Institue. August 1998. Also availabe in Proceedings of the OOPSLA '98 Workshop on the Formal Underpinnings of Java, Vancouver, B.C., October 1998.
8. CYTRON, R., FERRANTE, J., ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F. K. 1989. An efficient method of computing static single assignment form. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages.
9. DAVEY, B. A. AND PRIESTLEY, H. A. 1990. Introduction to Lattices and Order. Cambridge Mathematical Textbooks, Cambridge University Press.
10. FITZGERALD, R., KNOBLOCK, T. B., RUF, E., STEENSGAARD, B., AND TARDITI, D. 2000. Marmot: An optimizing compiler for Java. Software: Practice and Experience 30, 3 (Mar.), 199-232.
11. FREUND, S. N. 1998. The costs and benefits of Java bytecode subroutines. In Formal Underpinnings of Java Workshop at OOPSLA. http://ww-dse.doc.ic.ac.edu/~sue/oopsla/cfp.html.
12. FREUND, S. N. AND MITCHELL, J. C. 1998. A type system for object initialization in the Java bytecode langague. In Proceedings OOPSLA '98, ACM SIGPLAN Notices. 310-328.
13. FREUND, S. N. AND MITCHELL, J. C. 1999. A type system for Java bytecode subroutines and exceptions. Tech. rep., Stanford Univeristy, Computer Science Department. April.
14. GAGNON, E. AND HENDREN, L. 1999. Intra-procedural inference of static types for Java bytecode. Tech. Rep. 1, McGill University.
15. GOLDBERG, A. 1997. A specification of Java loading and bytecode verification. Tech. Rep. KES.U.92.1, Kestrel Institute. December.
16. GOSLING, J., JOY, B., AND STEELE, G. 1996. The Java Language Specification. The Java Series. Addison-Wesley, Reading, MA, USA.
17. HOANG, M. AND MITCHELL, J. C. 1995. Lower bounds on type inference with subtypes. In Proc. 22nd Annual ACM Symposium on Principles of Programming Languages (POPL). ACM Press, 176-185.
18. IBM. 1998. IBM high performance compiler for Java: An optimizing native code compiler for Java applications, http://www.alphaworks.ibm.com/graphics.nsf/system/graphics/HPCJ/ $file/highpcj.html.
19. INSTANTIATIONS, INC. 1998. Jove: Super optimizing deployment environment for Java. http://www.instantiations.com/javaspeed/jovereport.htm.
20. KOZEN, D., PALSBERG, J., AND SCHWARTZBACH, M. I. 1994. Efficient inference of partial types. Journal of Computer and System Sciences 49, 2, 306-324.
21. LEAGUE, C., SHAO, Z., AND TRIFONOV, V. 1999. Representing java classes in a typed intermediate language. In Proceedings of the 1999 ACM SIGPLAn Internationl Conference on Functional Programming.
22. LEROY, X. AND OHORI, A., Eds. 1998. Types in Compilation. Number 1473 in LNCS. Springer-Verlag.
23. LINCOLN, P. AND MITCHELL, J. C. 1992. Algorithmic aspects of type inference with subtypes. In Proceedings of the Nineteenth Annual ACM Symposium on Principles of Programming Languages. 293-304.
24. LINDHOLM, T. AND YELLIN, F. 1999. The Java Virtual Machine Specification, Second Edition ed. Addison-Wesley.
25. MACNEILLE, H. M. 1937. Partially ordered sets. Transactions of the American Mathematical Society 42, 90-96.
26. MORRISETT, G., WALKER, D., CRARY, K., AND GLEW, N. 1997. From system F to typed assembly language. Tech. Rep. TR97-1651, Cornell University.
27. MORRISETT, J. G. 1995. Compiling with types. Ph.D. thesis, Carnegie Mellon University. Published as CMU Technical Report CMU-CS-95-226.
28. NATURALBRIDGE, LLC. 1998. Bullettrain Java compiler technology. http://www.naturalbridge.com/.
29. NECULA, G. C. 1998. Compiling with proofs. Ph.D. thesis, Carnegie Mellon University.
30. O'CALLAHAN, R. 1999. A simple, comprehensive type system for Java bytecode subroutines. In Proceedings 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 70-78.
31. OHEIMB, D. V. AND NIPKOW, T. 1999. Machine-checking the Java specification: Proving type-safety. In Formal Syntax and Semantics of Java, J. Alves-Foss, Ed. LNCS, vol. 1523. Springer-Verlag, 119-156.
32. PALSBERG, J. AND O'KEEFE, P. 1995. A type system equivalent to flow analysis. ACM Transactions on Programming Languages and Systems 17, 4 (July), 576-599.
33. PRATT, V. AND TIURYN, J. 1996. Satisfiability of inequalities in a poset. Fundamenta Informaticae 28, 1-2, 165-182.
34. PUSCH, C. 1999. Proving the soundness of a Java bytecode verifier specification in Isabelle/HOL. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), W. R. Cleaveland, Ed. LNCS, vol. 1579. Springer-Verlag, 89-103.
35. QIAN, Z. 1998. A formal specification of a large subset of Java virtual machine instructions for objects, methods and subroutines. In Formal Syntax and Semantics of Java, J. Alves-Foss, Ed. Number 1523 in LNCS. Springer-Verlag.
36. QIAN, Z. 1999. Least types for memory locations in (Java) bytecode. Tech. rep., Kestrel Institute, http://www.kestrel.edu/HTML/people/qian/pub-list.html.
37. REHOF, J. AND MOGENSEN, T. Æ.. 1999. Tractable constraints in finite semilattices. Science of Computer Programming 35, 2, 191-221.
38. SHIVERS, O. 1991. Data-flow analysis and type recovery in scheme. In Topics in Advanced Language Implementation, P. Lee, Ed. The MIT Press, Chapter 3, 47-87.
39. STATA, R. AND ABADI, M. 1998. A type system for Java bytecode subroutines. In Proceedings 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 149-160.
40. SUPERCEDE, INC. 1998. SuperCede for Java, Version 2.03, Upgrade Edition. http://www.supercede.com/.
41. SYME, D. 1997. Proving JavaS type soundness. Tech. Rep. 427, University of Cambridge Computer Laboratory.
42. TARDITI, D. 1996. Design and implementation of code optimizations for a type-directed compiler for standard ml. Ph.D. thesis, Carnegie Mellon University.
43. TARJAN, R. E. 1972. Depth first search and linear graph algorithms. SIAM Journal on Computing 1, 2, 146-160.
44. TIURYN, J. 1992. Subtype inequalities. In Proc. 7th Annual IEEE Symp. on Logic in Computer Science (LICS), Santa Cruz, California. IEEE Computer Society Press, 308-315.
45. WAND, M. 1987. A simple algorithm and proof for type inference. Fundamenta Informaticae X, 115-122.
46. YELLAND, P. M. 1999. A compositional account of the Java virtual machine. In Proceedings 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 57-59.