A Concept-Driven Construction of the Mondex Protocol Using Three Refinements

  • Authors:
  • Gerhard Schellhorn;Richard Banach

  • Affiliations:
  • Lehrstuhl für Softwaretechnik und Programmiersprachen, Universität Augsburg, Augsburg, Germany D-86135;School of Computer Science, University of Manchester, Manchester, U.K. M13 9PL

  • Venue:
  • ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Mondex case study concerns the formal development and verification of an electronic purse protocol. Several groups have worked on its specification and mechanical verification, their solutions being (as were ours previously), either one big step or several steps motivated by the task's complexity. A new solution is presented that is structured into three refinements, motivated by the three concepts underlying Mondex: a message protocol to transfer money over a lossy medium, protection against replay attacks, and uniqueness of transfers using sequence numbers. We also give an improved proof technique based on our theoretical results on verifying interleaved systems.