Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Mostowski, W. (2007). From Sequential Java to Java Card. In: Beckert, B., Hähnle, R., Schmitt, P.H. (eds) Verification of Object-Oriented Software. The KeY Approach. Lecture Notes in Computer Science(), vol 4334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69061-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-69061-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68977-5
Online ISBN: 978-3-540-69061-0
eBook Packages: Computer ScienceComputer Science (R0)