The mondex challenge: Machine checked proofs for an electronic purse

28Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Schellhorn, G., Grandy, H., Haneberg, D., & Reif, W. (2006). The mondex challenge: Machine checked proofs for an electronic purse. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4085 LNCS, pp. 16–31). Springer Verlag. https://doi.org/10.1007/11813040_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free