Machine checked formal proof of a scheduling protocol for smartcard personalization

  • Authors:
  • Leonard Lensink;Sjaak Smetsers;Marko Van Eekelen

  • Affiliations:
  • Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands;Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands;Institute for Computing and Information Sciences, Radboud University, Nijmegen, The Netherlands

  • Venue:
  • FMICS'07 Proceedings of the 12th international conference on Formal methods for industrial critical systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Using PVS (Prototype Verification System), we prove thatan industry designed scheduler for a smartcard personalization machineis safe and optimal. This scheduler has previously been the subject ofresearch in model checked scheduling synthesis and verification. Theseverification and synthesis efforts had only been done for a limited numberof personalization stations. We have created an executable modeland have proven the scheduling algorithm to be optimal and safe forany number of personalization stations. This result shows that theoremprovers can be successfully used for industrial problems in cases wheremodel checkers suffer from state explosion.