Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization

Abstract

Abstract. Using PVS (Prototype Verification System), we prove that an industry designed scheduler for a smartcard personalization machine is safe and optimal. This scheduler has previously been the subject of research in model checked scheduling synthesis and verification. These verification and synthesis efforts had only been done for a limited number of personalization stations. We have created an executable model and have proven the scheduling algorithm to be optimal and safe for any number of personalization stations. This result shows that theorem provers can be successfully used for industrial problems in cases where model checkers suffer from state explosion.

Verifying Functional Formalizations – A Type-Theoretical Case Study in PVS

“…The present research is part of a larger project using PVS for both the verification of existing software [7] and the development of new software [8]. For instance, the correctness of a scheduling protocol for a smart-card personalization machine has been proven in [10]. This protocol was used as a case study to test the power of model checkers.…”