Code annotation for safe and efficient dynamic object resolution

Electronic Notes in Theoretical Computer Science

Volumn 82, Issue 2, 2004, Pages 362-376

  Hartmann, Andreas ^a   Amme, Wolfram ^a   Von Ronne, Jeffery ^b   Franz, Michael ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; BOOLEAN ALGEBRA; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; DATA REDUCTION; DYNAMIC LOADS; MATHEMATICAL MODELS;

ANNOTATED PROGRAMS; CODE ANNOTATION; JUST-IN-TIME (JIT) COMPILERS; OBJECT RESOLUTION;

COMPUTER PROGRAMMING;

EID: 18844396159     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82597-6     Document Type: Conference Paper

References (20)

1. Amme W., Dalton N., von Ronne J., Franz M. SafeTSA: A type safe and referentially secure mobile-code representation based on static single assignment form. SIGPLAN '01 Conference on Programming Language Design and Implementation. 2001;137-147
2. Amme W., von Ronne J., Franz M. Using the safetsa representation to boost the performance of an existing java virtual machine. 10th International Workshop on Compilers for Parallel Computers (CPC). 2003
3. Azevedo A., Nicolau A., Hummel J. An annotation-aware java virtual machine implementation. Concurrency - Practice and Experience. 12:(6):2000;423-444
4. Blanchet B. Escape analysis for object-oriented languages: application to Java. ACM SIGPLAN Notices. 34:(10):1999;20-34
5. Choi J.-D., Gupta M., Serrano M.J., Sreedhar V.C., Midkiff S.P. Escape analysis for java. Conference on Object-Oriented. 1999;1-19
6. Deutsch A. Interprocedural may-alias analysis for pointers: beyond k-limiting. ACM SIGPLAN Notices. 29:(6):1994;230-241
7. Fitzgerald R., Knoblock T.B., et al. Marmot: An optimizing compiler for Java. Microsoft Technical Report. 3:March 2000;Microsoft
8. Franz M., Krintz C., Haldar V., Stork C.H. Tamper proof annotations. Technical Report. 02-10:Mar. 2002;Department of Information and Computer Science, University of California, Irvine
9. Gay D., Steensgaard B. Fast escape analysis and stack allocation for object-based programs. th International Conference on Compiler Construction (CC'2000). volume 1781:2000;Springer-Verlag
10. Hannan J. A type-based escape analysis for functional languages. Journal of Functional Programming. 8:(3):May 1998;239-273
11. L. Hederman. Compile-time Garbage Collection Using Reference Count Analysis. PhD thesis, Rice University, Aug. 1988. Also Rice University Technical Report TR88-75 but, according to Rice University's technical report list, this report is no longer available for distribution.
12. Hudak P. A semantic model of reference counting and its abstraction. In Proceedings of the 1986 ACM Conference on Lisp and Functional Programming. Aug. 1986;351-363 ACM. ACM
13. Krintz C., Calder B. Using annotation to reduce dynamic optimization time. SIGPLAN Conference on Programming Language Design and Implementation. 2001;156-167
14. C. McDowell. Garbage reduction in java. In Internet Publication http://www.cse.ucsc.edu/research/embedded/pubs/gc, 1982.
15. Park Y.G., Goldberg B. Reference escape analysis: Optimizing reference counting based on the lifetime of references. Partial Evaluation and Semantic-Based Program Manipulation. 1991;178-189
16. Salcianu A., Rinard M.C. Pointer and escape analysis for multithreaded programs. In Principles Practice of Parallel Programming. 2001;12-23
17. Serrano M., Feeley M. Storage use analysis and its applications. In Proceedings of the 1fst International Conference on Functional Programming. June 1996;12. Philadelphie
18. Steensgaard B. Points-to analysis in almost linear time. Symposium on Principles of Programming Languages. 1996;32-41
19. Vivien F., Rinard M.C. Incrementalized pointer and escape analysis. SIGPLAN Conference on Programming Language Design and Implementation. 2001;35-46
20. Whaley J., Rinard M. Compositional pointer and escape analysis for Java programs. ACM SIGPLAN Notices. 34:(10):1999;187-206