The mondex challenge: machine checked proofs for an electronic purse

  • Authors:
  • Gerhard Schellhorn;Holger Grandy;Dominik Haneberg;Wolfgang Reif

  • Affiliations:
  • Lehrstuhl für Softwaretechnik und Programmiersprachen, Universität Augsburg, Augsburg, Germany;Lehrstuhl für Softwaretechnik und Programmiersprachen, Universität Augsburg, Augsburg, Germany;Lehrstuhl für Softwaretechnik und Programmiersprachen, Universität Augsburg, Augsburg, Germany;Lehrstuhl für Softwaretechnik und Programmiersprachen, Universität Augsburg, Augsburg, Germany

  • Venue:
  • FM'06 Proceedings of the 14th international conference on Formal Methods
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Mondex case study about the specification and refinement of an electronic purse as defined in [SCJ00] has recently been proposed as a challenge for formal system-supported verification. This paper reports on the successful verification of the major part of the case study using the KIV specification and verification system. We demonstrate that even though the hand-made proofs were elaborated to an enormous level of detail, we still could find small errors in the underlying data refinement theory as well as the formal proofs of the case study. We also provide an alternative formalisation of the communication protocol using abstract state machines. Finally the Mondex case study verifies functional correctness assuming a suitable security protocol. Therefore we propose to extend the case study to include the verification of a suitable security protocol.