Case Studies in Meta-Level Theorem Proving
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
An Integration of Model Checking with Automated Proof Checking
Proceedings of the 7th International Conference on Computer Aided Verification
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Formal Aspects of Computing
Optimal scheduling using branch and bound with SPIN 4.0
SPIN'03 Proceedings of the 10th international conference on Model checking software
SMTT'03 Proceedings of the 2003 international conference on Scenarios: models, Transformations and Tools
Hi-index | 0.00 |
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.