Correctness of Java Card method lookup via logical relations

Authors:
Ewen Denney;Thomas Jensen
Affiliations:
Univ. of Edinburgh, Scotland, UK;Campus de Beaulieu, Rennes Cedex, France
Venue:
Theoretical Computer Science
Year:
2002

Citing 5
Cited 0

Foundations of programming languages

Foundations of programming languages
Java Virtual Machine Specification

Java Virtual Machine Specification
Defining the Java Virtual Machine as Platform for Provably Correct Java Compilation

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Verification of Compiler Correctness for the WAM

TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Formal Proof of Smart Card Applets Correctness

CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications

Quantified Score

Hi-index	5.23

Visualization

Abstract

This article presents a formalisation of the bytecode optimisation of Sun's Java Card language from the class file to CAP file format as a set of constraints between the two formats, and defines and proves its correctness. Java Card bytecode is formalised using an abstract operational semantics, which can then be instantiated into the two formats. The optimisation is given as a logical relation such that the instantiated semantics are observably equal.