메뉴 건너뛰기




Volumn , Issue , 2002, Pages

sEc: A portable interpreter optimizing technique for embedded Java virtual machine

Author keywords

Embedded JVM; Interpreter; Java virtual machine; JIT; Optimization; Performance; Semantically enriched code

Indexed keywords

ENGINEERING RESEARCH; NETWORK SECURITY; VIRTUAL MACHINE;

EID: 0037574176     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (6)

References (35)
  • 4
    • 84862454054 scopus 로고    scopus 로고
    • Java TM, Virtual Machine Specification, Addison Wesley Publications, ISBN 0-201-63452-X
    • Java TM Virtual Machine Specification, Tim Lindholm and Frank Yellin, The Java Series, Addison Wesley Publications, ISBN 0-201-63452-X.
    • The Java Series
    • Lindholm, Tim1    Yellin, Frank2
  • 12
    • 0029204372 scopus 로고    scopus 로고
    • Optimizing an ANSI C Interpreter with Superoperators
    • Optimizing an ANSI C Interpreter with Superoperators, Todd A. Proebsting, Proc POPL'95 pages 322-332
    • Proc POPL'95 , pp. 322-332
    • Proebsting, Todd A.1
  • 19
    • 84976768544 scopus 로고    scopus 로고
    • BrouHaha - A Portable Smalltalk Interpreter - Eliot Miranda
    • BrouHaha - A Portable Smalltalk Interpreter - Eliot Miranda, Proc. OOPSLA 1987. Published as SIGPLAN Notices 22(12):354-365.
    • Proc. OOPSLA 1987. Published as SIGPLAN Notices , vol.22 , Issue.12 , pp. 354-365
  • 21
    • 85093118539 scopus 로고
    • Compilers and Computer Architecture Carnegie-Mellon University, July
    • Compilers and Computer Architecture - William A. Wulf, Carnegie-Mellon University, IEEE Computer Journal, July 1981.
    • (1981) IEEE Computer Journal
    • Wulf, William A.1
  • 23
    • 85050550846 scopus 로고
    • Abstract Interpretation: A Unified Lattice Model For Static Analysis Of Programs by Construction Or Approximation Of Fixpoints - Patrick Cousot and Radhia Cousot
    • Abstract Interpretation: A Unified Lattice Model For Static Analysis Of Programs by Construction Or Approximation Of Fixpoints - Patrick Cousot and Radhia Cousot, Fourth ACM symposium on Principles of Programming Languages, 1977.
    • (1977) Fourth ACM symposium on Principles of Programming Languages
  • 26
    • 0023367454 scopus 로고
    • Garbage collection can be faster than stack allocation
    • 17 June
    • Garbage collection can be faster than stack allocation - Andrew W. Appel. Information Processing Letters 25(4):275-279, 17 June 1987.
    • (1987) Information Processing Letters , vol.25 , Issue.4 , pp. 275-279
    • Appel, Andrew W.1
  • 27
    • 84976820263 scopus 로고
    • Optimal code generation for expression trees July
    • Optimal code generation for expression trees - A. V. Aho and S. C. Johson, Journal of the ACM 23(3): 488 - 501, July 1976.
    • (1976) Journal of the ACM , vol.23 , Issue.3 , pp. 488-501
    • Aho, A. V.1    Johson, S. C.2
  • 30
    • 85093104507 scopus 로고    scopus 로고
    • Harissa: A Flexible and Efficient Java Environment Mixing Bytecode and Compiled Code IRIA INRIA University of Rennes
    • Harissa: A Flexible and Efficient Java Environment Mixing Bytecode and Compiled Code - Gilles Muller, Barbara Moura, Fabrice Bellard, Charles Consel - IRIA / INRIA - University of Rennes.
    • Muller, Gilles1    Moura, Barbara2    Bellard, Fabrice3    Consel, Charles4


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