SafeTSA: A type safe and referentially secure mobile-code representation based on static single assignment form

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 5, 2001, Pages 137-146

  Amme, Wolfram ^a   Dalton, Niall ^a   Von Ronne, Jeffery ^a   Franz, Michael ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18844362658     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/381694.378825     Document Type: Article

References (30)

1. B. Alpern, C. R. Attanasio, et al. The Jalapeno virtual machine. IBM System Journal, 39(1), February 2000.
2. B. Alpern, A. Cocchi, D. Lieber, M. Mergen, and V. Sarkar. Jalapeno - a compiler-supported java virtual machine for servers. Workshop on Compiler Support for Software System (WCSSS 99), May 1999.
3. W. Amme and E. Zehendner. Data dependence analysis in programs with pointers. Parallel Computing, 24(3-4):505-525, May 1998.
4. Architecture Neutral Distribution Format (XANDF) Specification. Open Group Specification P527, January 1996.
5. M. Arnold, S. Fink, et al. Adaptive optimization in the Jalapeno JVM. ACM OOPLSA 2000, 2000.
6. M. M. Brandis and H. Mössenböck. Single-pass generation of static single-assignment form for structured languages. ACM Trans. Prog. Lang. and Sys., 16(6):1684-1698, Nov. 1994.
7. P. Briggs, K. D. Cooper, T. J. Harvey, and L. T. Simpson. Practical improvements to the construction and destruction of static single assignment form. Software Practice and Experience, 28(8):859-881, July 1998.
8. C. Click. Combining Analyses, Combining Optimizations. PhD thesis, Rice University, Houston, Texas.
9. R. Crelier. OP2: A Portable Oberon Compiler. Technical Report 1990TR-125, Swiss Federal Institute of Technology, Zurich, Feb., 1990.
10. R. Cytron, J. Ferrante, B. K. Rosen, M. K. Wegman, and F. K. Zadeck. An efficient method of computing static single assignment form. In POPL '89, 1989.
11. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Prog. Lang. and Sys., 13(4):451-490, Oct. 1990.
12. A. Diwan, K. S. McKinley, and J. E. B. Moss. Type-based alias analysis. ACM SIGPLAN Notices, 33(5):106-117, May 1998.
13. R. Fitzgerald, T. B. Knoblock, et al. Marmot: An optimizing compiler for Java. Microsoft Technical Report 3, Microsoft Research, March 2000.
14. M. Franz and T. Kistler. Slim Binaries. Communications of the ACM, 40(12):87-94, Dec. 1997.
15. S. Ghemawat, K. H. Randall, and D. J. Scales. Field analysis: Getting useful and low-cost interprocedural information. In PLDI '00, 2000.
16. Sun Hotspot compiler for Java. http://java.sun.com/products/hotspot/.
17. D. A. Huffman. A method for the construction of minimum redundancy codes. In Proceedings of the IRE, 40, pages 1098-1101, 1951.
18. J. Hummel, A. Azevedo, D. Kolson, and A. Nicolau. Annotating the Java bytecodes in support of optimization. Concurrency: Practice and Experience, 9(11):1003-1016, Nov. 1997. Special Issue: Java for computational science and engineering - simulation and modeling II.
19. T. Kistler. Continuous Program Optimization. Phd Dissertation, University of California, Irvine, 1999.
20. T. Kistler and M. Franz. A Tree-Based alternative to Java byte-codes. International Journal of Parallel Programming, 27(1):21-34, Feb. 1999.
21. T. Lengauer and R. E. Tarjan. A fast algorithm for finding dominators in a flowgraph. ACM Trans. Prog. Lang. and Sys., 1(1):121-141, July 1979.
22. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to Typed Assembly Language. ACM Trans. Prog. Lang. and Sys., 23(3):528-569, May 1999.
23. G. C. Necula. Proof-Carrying Code. In POPL '97, Paris, France, Jan. 1997.
24. K. V. Nori, U. Ammann, et al. Pascal-P implementation notes. In D. W. Barron, editor, Pascal - The Language and its Implementation, pages 125-170. John Wiley and Sons, Ltd., 1981.
25. M. Odersky and P. Wadler. Pizza into Java: Translating theory into practice. In Conference Record of POPL '97, pages 146-159, Paris, France, 15-17 Jan. 1997.
26. M. Poletto and V. Sarkar. Linear scan register allocation. ACM Trans. Prog. Lang. and Sys., 21(5):895-913, September 1999.
27. D. J. Scales, K. H. Randall, S. Ghemawat, and J. Dean. The Swift Java Compiler: Design and Implementation. WRL Research Report 2000/2, Compaq Research, April 2000.
28. V. C. Sreedhar and G. R. Gao. A linear time algorithm for placing [phi]-nodes. In ACM, editor, Conference record of POPL '95, pages 62-73, New York, NY 10036, USA, 1995. ACM Press.
29. R. F. Stärk and J. Schmid. Java bytecode verification is not possible. Technical report, ETH Zürich, Nov. 2000.
30. J. Wang, C. Eisenbeis, M. Jourdan, and B. Su. Decomposed software pipelining: A new perspective and a new approach. International Journal of Parallel Programming, 22(3):351-373, June 1994.