Skip to main content
Journal Article

A formally verified calculus for full java card

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3116 491-505
DOI: 10.1007/978-3-540-27815-3_37
26Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a calculus for the verification of sequential Java programs. It supports all Java language constructs and has additional support for Java Card. The calculus is formally proved correct with respect to a natural semantics. It is implemented in the KIV system and used for smart card applications. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Stenzel, K. (2004). A formally verified calculus for full java card. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3116, 491–505. https://doi.org/10.1007/978-3-540-27815-3_37

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