From Sequential Java to Java Card

  • Wojciech Mostowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4334)


The Java Card dialect of Java is often thought of as a subset of Java. Java Card is used to program smart cards, and due to the limited nature of smart cards Java Card is a much simpler programming language than Java; currently, there is no concurrency in Java Card, floating point arithmetic, or dynamic class loading. Because of these simplifications, verification of smart card applications written in Java Card is substantially easier than verification of full-featured Java applications. However, there are some smart card specific features in Java Card that are not present in standard Java, namely object persistency and an atomic transaction mechanism. Another way to put it is that, technically, Java Card is not a subset of Java, it is a superset of a subset of Java. This chapter explains these Java Card specific features and describes extensions to the basic Java Card DL to handle them. In this chapter we assume that the reader is already familiar with basic Java Card DL presented in Chapter 3.


Smart Card Array Element Assignment Rule Loop Body Proof Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Wojciech Mostowski

There are no affiliations available

Personalised recommendations