Verifying Java Card Programs

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10001)


This chapter presents the extension of KeY and JavaDL to handle a particular and peculiar dialect of Java, namely Java Card, for programming smart cards. The necessary extensions to the logic and the specification language are discussed, followed by a number of small case studies. The chapter is concluded with applications of the ideas presented here to on-going and future research, in particular in reasoning about concurrent Java programs.


Smart Card Transaction Statement Persistent Memory Transaction Abort Transient Memory 
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 International Publishing AG 2016

Authors and Affiliations

  1. 1.Halmstad UniverstiyHalmstadSweden

Personalised recommendations