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 条
  • [31] Java']Java bytecode optimizations
    Lambright, HD
    IEEE COMPCON 97, PROCEEDINGS, 1997, : 206 - 210
  • [32] A Java']Java Bytecode Formalisation
    Czarnik, Patryk
    Chrzaszcz, Jacek
    Schubert, Aleksy
    VERIFIED SOFTWARE: THEORIES, TOOLS, AND EXPERIMENTS, (VSTTE 2018), 2018, 11294 : 135 - 154
  • [33] A study on how to reduce time and space by redefining new bytecode for Java']Java Card
    Jin, MS
    Jung, MS
    11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Proceedings, 2005, : 551 - 554
  • [34] The synthesis of a Java']Java Card tokenisation algorithm
    Denney, E
    16TH ANNUAL INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING (ASE 2001), PROCEEDINGS, 2001, : 43 - 50
  • [35] Verification of JAVA']JAVA CARD applets behavior with respect to transactions and card tears
    Marche, Claude
    Rousset, Nicolas
    SEFM 2006: FOURTH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS, PROCEEDINGS, 2006, : 137 - +
  • [36] An efficient optimization algorithm of Java']Java bytecode to reduce network traffic
    Kim, DW
    Jung, MS
    COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2003, PT 2, PROCEEDINGS, 2003, 2668 : 542 - 551
  • [37] On object initialization in the Java']Java bytecode
    Doyon, S
    Debbabi, M
    COMPUTER COMMUNICATIONS, 2000, 23 (17) : 1594 - 1605
  • [38] A dynamic Logic for the formal verification of Java']Java Card programs
    Beckert, B
    JAVA ON SMART CARDS: PROGRAMMING AND SECURITY, 2001, 2041 : 6 - 24
  • [39] Dynamic semantics of Java']Java bytecode
    Bertelsen, P
    FUTURE GENERATION COMPUTER SYSTEMS, 2000, 16 (07) : 841 - 850
  • [40] 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 - +