Abstract
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.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this chapter
Cite this chapter
Mostowski, W. (2016). Verifying Java Card Programs. In: Ahrendt, W., Beckert, B., Bubel, R., Hähnle, R., Schmitt, P., Ulbrich, M. (eds) Deductive Software Verification – The KeY Book. Lecture Notes in Computer Science(), vol 10001. Springer, Cham. https://doi.org/10.1007/978-3-319-49812-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-49812-6_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49811-9
Online ISBN: 978-3-319-49812-6
eBook Packages: Computer ScienceComputer Science (R0)