A B model for ensuring soundness of a large subset of the java card virtual machine

Citations of this article
Mendeley users who have this article in their library.


Java Cards are a new generation of smart cards that use the Java programming language. As smart cards are usually used to supply security to an information system, security requirements are very strong. The byte code interpreter and verifier are crucial components of such cards, and proving their safety can become a competitive advantage. Previous works have been done on methodology for proving the soundness of the byte code interpreter and verifier using the B method. It refines an abstract defensive interpreter into a byte code verifier and a byte code interpreter. However, this work had only been tested on a very small subset of the Java Card instruction set. This paper presents a work aiming at verifying the scalability of this previous work. The original instruction subset of about 10 instructions has been extended to a larger subset of more than one hundred instructions, and the additional cost of the proof has been managed by modifying the specification in order to group opcodes by properties. © 2002 Elsevier Science B.V. All rights reserved.




Requet, A. (2003). A B model for ensuring soundness of a large subset of the java card virtual machine. In Science of Computer Programming (Vol. 46, pp. 283–306). https://doi.org/10.1016/S0167-6423(02)00095-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free