Using contour marking bytecode verification algorithm on the java']java card

被引:0
|
作者
Jiang, Longlong [1 ]
Li, Daiping [1 ]
机构
[1] Guangdong Univ Technol, Fac Comp, Guangzhou 510006, Guangdong, Peoples R China
关键词
card bytecode verification; multivariate verification; the verification of subroutine; contour making; type safety;
D O I
10.4028/www.scientific.net/AMM.556-562.4120
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Java bytecode verification could not be well performed in the smart card due to the resource usage especially in the resource-constrained devices. Currently, on the card there are several bytecode verifications which exist kinds of problems, in order to be better and be better adapt to the environment, such as a smart card platform, raised using the contour subroutine labeled bytecode verification algorithm on a card. First, through the analysis of existing card byte code verification algorithm to determine the imperfections and difficulties in the judgment and the verification of subroutine, and then propose a method for marking the subroutine in the place of the jump to it. Thus not only get the program structure and enhance the effectiveness and efficiency of the validation. The feasibility of the method is demonstrated by simulating typical examples verification.
引用
收藏
页码:4120 / +
页数:2
相关论文
共 50 条
  • [41] Termination analysis of Java']Java Bytecode
    Albert, Elvira
    Arenas, Puri
    Codish, Michael
    Genaim, Samir
    Puebla, German
    Zanardini, Damiano
    FORMAL METHODS FOR OPEN OBJECT-BASED DISTRIBUTED SYSTEMS, PROCEEDINGS, 2008, 5051 : 2 - +
  • [42] Deadlock Detection of Java']Java Bytecode
    Laneve, Cosimo
    Garcia, Abel
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION (LOPSTR 2017), 2018, 10855 : 37 - 53
  • [43] Reverse execution of Java']Java bytecode
    Cook, JJ
    COMPUTER JOURNAL, 2002, 45 (06): : 608 - 619
  • [44] Using compressed bytecode traces for slicing Java']Java programs
    Wang, T
    Roychoudhury, A
    ICSE 2004: 26TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, PROCEEDINGS, 2004, : 512 - 521
  • [45] Cost analysis of Java']Java bytecode
    Albert, E.
    Arenas, P.
    Genaim, S.
    Puebla, G.
    Zanardini, D.
    PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2007, 4421 : 157 - +
  • [46] Simple verification technique for complex Java bytecode subroutines
    Kestrel Institute, 3260 Hillview Avenue, Palo Alto, CA 94304, United States
    1600, 647-670 (June 2004):
  • [47] Optimizing Java']Java bytecode using the Soot framework:: Is it feasible?
    Vallée-Rai, R
    Gagnon, E
    Hendren, L
    Lam, P
    Pominville, P
    Sundaresan, V
    COMPILER CONSTRUCTION, PROCEEDINGS, 2000, 1781 : 18 - 34
  • [48] Dependence analysis of Java']Java bytecode
    Zhao, JJ
    24TH ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COSPSAC 2000), 2000, 24 : 486 - 491
  • [49] A Java']Java image contour algorithm for Herschel DP
    Regibo, Sara
    Vandenbussche, Bart
    De Meester, Wim
    ASTRONOMICAL DATA ANALYSIS SOFTWARE AND SYSTEMS XVII, 2008, 394 : 315 - 318
  • [50] An asymmetric fingerprint matching algorithm for Java']Java Card™
    Bistarelli, Stefano
    Santini, Francesco
    Vaccarelli, Anna
    PATTERN ANALYSIS AND APPLICATIONS, 2006, 9 (04) : 359 - 376