The card performs a linear type inference and uses the result to verify that the loaded code is well typed. This article proposes to model the second part of the FA ADE verification process and to prove the correctness of the algorithm. As the precomputation used for the verification cannot be trusted, it is necessary to ensure that the verification algorithm will never accept an ill-typed program, even if the precomputation has been modified. We present the approach chosen to prove that if the program is accepted, then it is correct versus the FA ADE semantics. We use the B method to abstract the algorithm and to prove it.
All trademarks are the property of their respective owners.
Gemplus Privacy Policy .