Validation of the JavaCard platform with implicit induction techniques

  • Authors:

  • Gilles Barthe;Sorin Stratulat

  • Affiliations:

  • INRIA Sophia-Antipolis, France;LITA, Université de Metz, France

  • Venue:
  • RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The bytecode verifier (BCV), which performs a static analysis to reject potentially insecure programs, is a key security function of the Java(Card) platform. Over the last few years there have been numerous projects to prove formally the correctness of bytecode verification, but relatively little effort has been made to provide methodologies, techniques and tools that help such formalisations. In earlier work, we develop a methodology and a specification environment featuring a neutral mathematical language based on conditional rewriting, that considerably reduce the cost of specifying virtual machines. In this work, we show that such a neutral mathematical language based on conditional rewriting is also beneficial for performing automatic verifications on the specifications, and illustrate in particular how implicit induction techniques can be used for the validation of the Java(Card) Platform. More precisely, we report on the use of SPIKE, a first-order theorem prover based on implicit induction, to establish the correctness of the BCV. The results are encouraging, as many of the intermediate lemmas required to prove the BCV correct can be proved with SPIKE.