The mondex challenge: Machine checked proofs for an electronic purse

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4085 LNCS, Issue , 2006, Pages 16-31

  Schellhorn, Gerhard ^a   Grandy, Holger ^a   Haneberg, Dominik ^a   Reif, Wolfgang ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK PROTOCOLS; SECURITY OF DATA;

DATA REFINEMENT; SECURITY PROTOCOLS; VERIFICATION SYSTEMS;

ELECTRONIC EQUIPMENT;

EID: 33749384522     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11813040_2     Document Type: Conference Paper

References (31)

1. [BGJY98] M. Bellare, J. Garay, C. Jutla, and M. Yung. VarietyCash: a Multi-purpose Electronic Payment System. In Proceedings of the 3rd USENIX Workshop on Electronic Commerce. USENIX, September 1998. URL: http://citeseer.ist.psu.edu/bellare98varietycash.html.
2. [BMV03] David Basin, Sebastian Mödersheim, and Luca Viganò. An On-The-Fly Model-Checker for Security Protocol Analysis. In Proceedings of Esorics'03, LNCS 2808, pages 253-270. Springer-Verlag, Heidelberg, 2003.
3. [Bör03] E. Börger. The ASM Refinement Method. Formal Aspects of Computing, 15 (1-2):237-257, November 2003.
4. [BR95] E. Börger and D. Rosenzweig. The WAM - definition and compiler correctness. In Christoph Beierle and Lutz Plümer, editors, Logic Programming: Formal Methods and Practical Applications, volume 11 of Studies in Computer Science and Artificial Intelligence, pages 20-90. North-Holland, Amsterdam, 1995.
5. [BS03] E. Börger and R. F. Stärk. Abstract State Machines - A Method for High-Level System Design and Analysis. Springer-Verlag, 2003.
6. [CB99] UK ITSEC Certification Body. UK ITSEC SCHEME CERTIFICATION REPORT No. P129 MONDEX Purse. Technical report, UK IT Security Evaluation and Certification Scheme, 1999. URL: http://www.cesg.gov.uk/site/iacs/itsec/media/certreps/CRP129.pdf.
7. [CCW96] E. K. Clemons, D. C. Croson, and B. W. Weber. Reengineering Money: The Mondex Stored Value Card and Beyond. In Proceedings of the 29th Annual Hawaii International Conference on Systems Sciences 1996. IEEE, 1996. URL: http://doi.ieeecomputersociety.org/10.1109/HICSS.1996.495345.
8. [CoF04] CoFI (The Common Framework Initiative). CASL Reference Manual. LNCS 2960 (IFIP Series). Springer, 2004.
9. [CSW02] D. Cooper, S. Stepney, and J. Woodcock. Derivation of Z Refinement Proof Rules: forwards and backwards rules incorporating input/output refinement. Technical Report YCS-2002-347, University of York, 2002. URL: http://www-users.cs.york.ac.uk/$\sim$susan/bib/ss/z/zrules.htm.
10. [DB01] J. Derrick and E. Boiten. Refinement in Z and in Object-Z: Foundations and Advanced Applications. FACIT. Springer, 2001.
11. [Gur95] Yuri Gurevich. Evolving algebras 1993: Lipari guide. In E. Börger, editor, Specification and Validation Methods, pages 9-36. Oxford Univ. Press, 1995.
12. [HGRS05] D. Haneberg, H. Grandy, W. Reif, and G. Schellhorn. Verifying Security Protocols: An ASM Approach. In D. Beauquier, E. Börger, and A. Slissenko, editors, 12th Int. Workshop on Abstract State Machines, ASM 05. University Paris 12 - Val de Marne, Créteil, France, March 2005.
13. [HHS86] He Jifeng, C. A. R. Hoare, and J. W. Sanders. Data refinement refined. In B. Robinet and R. Wilhelm, editors, Proc. ESOP 86, volume 213 of Lecture Notes in Computer Science, pages 187-196. Springer-Verlag, 1986.
14. [HKT00] D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000.
15. [KIV] Web presentation of the mondex case study in KIV. URL: http://www.informatik.uni-augsburg.de/swt/projects/mondex.html.
16. [Low96] Gavin Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), volume 1055, pages 147-166. Springer-Verlag, 1996.
17. [MCI] MasterCard International Inc. Mondex. URL: http://www.mondex.com.
18. [Pau98] L. C. Paulson. The Inductive Approach to Verifying Cryptographic Protocols. J. Computer Security, 6:85-128, 1998.
19. [Pau01] Lawrence C. Paulson. Verifying the SET Protocol. In R. Gore, A. Leitsch, and T. Nipkow, editors, IJCAR 2001: International Joint Conference on Automated Reasoning, Siena, Italy, 2001. Springer LNCS 2083.
20. [RE03] W. Rankl and W. Effing. Smart Card Handbook. John Wiley & Sons, 3rd edition, 2003.
21. [RSSB98] Wolfgang Reif, Gerhard Schellhorn, Kurt Stenzel, and Michael Balser. Structured specifications and interactive proofs with KIV. In W. Bibel and P. Schmitt, editors, Automated Deduction - A Basis for Applications, volume II: Systems and Implementation Techniques, chapter 1: Interactive Theorem Proving, pages 13-39. Kluwer Academic Publishers, Dordrecht, 1998.
22. [SA97] Gerhard Schellhorn and Wolfgang Ahrendt. Reasoning about Abstract State Machines: The WAM Case Study. Journal of Universal Computer Science (J.UCS), 3(4):377-413, 1997. URL: http://hyperg.iicm.tu-graz.ac.at/jucs/.
23. [SA98] Gerhard Schellhorn and Wolfgang Ahrendt. The WAM Case Study: Verifying Compiler Correctness for Prolog with KIV. In W. Bibel and P. Schmitt, editors, Automated Deduction - A Basis for Applications, pages 165-194. Kluwer Academic Publishers, Dordrecht, 1998.
24. [Sch99] Gerhard Schellhorn. Verification of Abstract State Machines. PhD thesis, Universität Ulm, Fakultät für Informatik, 1999. URL: http://www.informatik.uni-augsburg.de/lehrstuehle/swt/se/publications/.
25. [Sch01] G. Schellhorn. Verification of ASM Refinements Using Generalized Forward Simulation. Journal of Universal Computer Science (J.UCS), 7(11):952-979, 2001. URL: http://hyperg.iicm.tu-graz.ac.at/jucs/.
26. [Sch05] G. Schellhorn. ASM Refinement and Generalizations of Forward Simulation in Data Refinement: A Comparison. Journal of Theoretical Computer Science, vol. 336, no. 2-3:403-435, May 2005.
27. [SCJ00] S. Stepney, D. Cooper, and Woodcock J. AN ELECTRONIC PURSE Specification, Refinement, and Proof. Technical monograph PRG-126, Oxford University Computing Laboratory, July 2000. URL: http://www-users.cs.york.ac.uk/~susan/bib/ss/z/monog.htm.
28. [SGHR06] Gerhard Schellhorn, Holger Grandy, Dominik Haneberg, and Wolfgang Reif. The Mondex Challenge: Machine Checked Proofs for an Electronic Purse. Technical Report 2006-2, Universität Augsburg, 2006.
29. [Spi92] J. M. Spivey. The Z Notation: A Reference Manual. Prentice Hall International Series in Computer Science, 2nd edition, 1992.
30. [WD96] J. C. P. Woodcock and J. Davies. Using Z: Specification, Proof and Refinement. Prentice Hall International Series in Computer Science, 1996.
31. [Woo06] J. Woodcock. Mondex case study, 2006. URL: http://qpq.csl.sri.com/vsr/shared/MondexCaseStudy/.