메뉴 건너뛰기




Volumn 2027, Issue , 2001, Pages 334-354

A framework for optimizing java using attributes

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; JAVA PROGRAMMING LANGUAGE; JUST IN TIME PRODUCTION;

EID: 84958960586     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45306-7_23     Document Type: Conference Paper
Times cited : (26)

References (26)
  • 2
    • 0034448902 scopus 로고    scopus 로고
    • ABCD: Eliminating Array Bounds Checks on Demand
    • June
    • R. Bodik, R. Gupta, and V. Sarkar. ABCD: Eliminating Array Bounds Checks on Demand. In Proceedings of PLDI '00, pages 321-333, June 2000.
    • (2000) Proceedings of PLDI '00 , pp. 321-333
    • Bodik, R.1    Gupta, R.2    Sarkar, V.3
  • 4
    • 0034449931 scopus 로고    scopus 로고
    • Practicing JUDO: Java under Dynamic Optimizations
    • June
    • Michal Cierniak, Guei-Yuan Lueh, and James M. Stichnoth. Practicing JUDO: Java under Dynamic Optimizations. In Proceedings of PLDI '00, pages 13-26, June 2000.
    • (2000) Proceedings of PLDI '00 , pp. 13-26
    • Cierniak, M.1    Lueh, G.-Y.2    Stichnoth, J.M.3
  • 6
    • 84906094634 scopus 로고    scopus 로고
    • Effcient inference of static types for Java bytecode
    • LNCS, June
    • Etienne M. Gagnon, Laurie J. Hendren, and Guillaume Marceau. Effcient inference of static types for Java bytecode. In Proceedings of SAS 2000, volume 1824 of LNCS, pages 199-219, June 2000.
    • (2000) Proceedings of SAS 2000 , vol.1824 , pp. 199-219
    • Gagnon, E.M.1    Hendren, L.J.2    Marceau, G.3
  • 7
    • 0034447511 scopus 로고    scopus 로고
    • Field Analysis: Getting Useful and Low-Cost Interprocedural Information
    • June
    • S. Ghemawat, K.H. Randall, and D.J. Scales. Field Analysis: Getting Useful and Low-Cost Interprocedural Information. In Proceedings of PLDI '00, pages 334-344, June 2000.
    • (2000) Proceedings of PLDI '00 , pp. 334-344
    • Ghemawat, S.1    Randall, K.H.2    Scales, D.J.3
  • 8
    • 0027568719 scopus 로고
    • Optimizing array bound checks using flow analysis
    • R. Gupta. Optimizing array bound checks using flow analysis. ACM Letters on Programming Languages and Systems, 2(1-4):135-150, 1993.
    • (1993) ACM Letters on Programming Languages and Systems , vol.2 , Issue.1-4 , pp. 135-150
    • Gupta, R.1
  • 9
    • 0017494622 scopus 로고
    • Compiler analysis of the value ranges of variables
    • W. Harrison. Compiler analysis of the value ranges of variables. IEEE Transactions on Software Engineering, 3(3):243-250, 1977.
    • (1977) IEEE Transactions on Software Engineering , vol.3 , Issue.3 , pp. 243-250
    • Harrison, W.1
  • 10
    • 0031271862 scopus 로고    scopus 로고
    • Annotating the Java bytecodes in support of optimization
    • November
    • Joseph Hummel, Ana Azevedo, David Kolson, and Alexandru Nicolau. Annotating the Java bytecodes in support of optimization. Concurrency: Practice and Experience, 9(11):1003-1016, November 1997.
    • (1997) Concurrency: Practice and Experience , vol.9 , Issue.11 , pp. 1003-1016
    • Hummel, J.1    Azevedo, A.2    Kolson, D.3    Nicolau, A.4
  • 11
    • 84969371155 scopus 로고    scopus 로고
    • The Jasmin Bytecode Assembler. http://mrl.nyu.edu/meyer/jvm/jasmin.html.
  • 12
    • 84969383391 scopus 로고    scopus 로고
    • JavaClass. http://www.inf.fu-berlin.de/dahm/JavaClass/.
  • 13
    • 0034187435 scopus 로고    scopus 로고
    • Annotating Java class files with virtual registers for performance
    • Joel Jones and Samuel Kamin. Annotating Java class files with virtual registers for performance. Concurrency: Practice and Experience, 12(6):389-406, 2000.
    • (2000) Concurrency: Practice and Experience , vol.12 , Issue.6 , pp. 389-406
    • Jones, J.1    Kamin, S.2
  • 14
    • 84969409162 scopus 로고    scopus 로고
    • Compaq-JTrek. http://www.digital.com/java/download/jtrek.
  • 15
    • 84976761124 scopus 로고
    • Elimination of redundant array subscript range checks
    • Priyadarshan Kolte and Michael Wolfe. Elimination of redundant array subscript range checks. In Proceedings of PLDI '95, pages 270-278, 1995.
    • (1995) Proceedings of PLDI '95 , pp. 270-278
    • Kolte, P.1    Wolfe, M.2
  • 18
    • 0031624344 scopus 로고    scopus 로고
    • Optimizing bounds checking in Java programs
    • August
    • S. Midki_, J. Moreira, and M. Snir. Optimizing bounds checking in Java programs. IBM Systems Journal, 37(3):409-453, August 1998.
    • (1998) IBM Systems Journal , vol.37 , Issue.3 , pp. 409-453
    • Midki, S.1    Moreira, J.2    Snir, M.3
  • 20
    • 0030685617 scopus 로고    scopus 로고
    • Proof-carrying code
    • January
    • G. Necula. Proof-carrying code. In Proceedings of POPL '97, pages 106-119, January 1997.
    • (1997) Proceedings of POPL '97 , pp. 106-119
    • Necula, G.1
  • 21
    • 84969408858 scopus 로고    scopus 로고
    • Soot a Java Optimization Framework. http://www.sable.mcgill.ca/soot/.
  • 24
    • 0033203879 scopus 로고    scopus 로고
    • Practical experience with an application extractor for Java
    • October
    • Frank Tip, Chris Laffra, Peter F. Sweeney, and David Streeter. Practical experience with an application extractor for Java. In Proceedings OOPSLA '99, pages 292-305, October 1999.
    • (1999) Proceedings OOPSLA '99 , pp. 292-305
    • Tip, F.1    Laffra, C.2    Sweeney, P.F.3    Streeter, D.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.