The Mondex Challenge: Machine Checked Proofs for an Electronic Purse

Schellhorn, Gerhard; Grandy, Holger; Haneberg, Dominik; Reif, Wolfgang

doi:10.1007/11813040_2

Cited by 29 publications

(30 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While the first [SGHR06b] used the original backward simulation and data refinement, the second uses abstract state machines (ASMs, [Gur95], [BS03]) together with ASM refinement and generalized forward simulations [Sch01].…”

Section: The Refinement Of Schellhorn Et Al [Sgh + 07]mentioning

confidence: 99%

“…1 Rather unusually for a commercial product, a sanitised version of the core of the formal development was made publicly available [SCW00]. Since then it has been a fertile ground for formal methods researchers -the original, human-built proofs of the security properties have been subjected to re-examination by contemporary techniques, and have stood up extremely well to the fiercest tool-based scrutiny achievable today, the first such mechanical verification being [SGHR06b].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Atomic actions, and their refinements to isolated protocols

Banach

Schellhorn

2010

Form. Asp. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract. Inspired by the properties of the refinement development of the Mondex Electronic Purse, we view an isolated atomic action as a family of transitions with a common before-state, and different after-states corresponding to different possible outcomes when the action is attempted. We view a protocol for an atomic action as a computation DAG, each path of which achieves in several steps one of the outcomes of the atomic action. We show that in this picture, the protocol can be viewed as a relational refinement of the atomic action in a number of ways. Firstly, it yields a 'big diagram' simulationà la ASM. Secondly, it yields a 'small diagram' simulation, in which the atomic action is synchronised with an individual step along each path through the protocol, and all the other steps of the path simulate skip. We show that provided each path through the protocol contains one step synchronised with the atomic action, the choice of synchronisation point can be made freely. We describe the relationship between such synchronisations and forward and backward simulations. We relate this theory to serialisations of system runs containing multiple interleaved transactions, showing how the clean picture of the refinement of an isolated atomic action to an isolated protocol becomes obscured by the details of the interleaving. In effect, the fact that protocols are typically executed by a number of co-operating agents, not all of which embark on executing the protocol at the same moment, results in 'ragged starts' and 'ragged ends' to protocol instantiations, leading to potential overlaps between unrelated protocol instances that the theory must handle. We show how existing Mondex refinements embody the ideas developed, and describe a mechanical verification of the results presented.

show abstract

Section: The Refinement Of Schellhorn Et Al [Sgh + 07]mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Atomic actions, and their refinements to isolated protocols

Banach

Schellhorn

2010

Form. Asp. Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…General idea of using this command for falsification is trying to explore the reachable state space of an OTS from its initial state to a state in which an invariant does not hold. To use the CafeOBJ search command, we need to (1) give an explicit state structure for an OTS S, and then obeying this state structure, to (2) give, for each action (representing a transition of S) defined in equations, additional state transition expressions. Assume that the state structure of an OTS is decided to be < υ >, then an additional state transition expression for the action expression described in Sect.…”

Section: Falsification With Search Commandmentioning

confidence: 99%

“…Mondex Electronic Purse [2], Analog and MixedSignal Circuits [3]). The benefits of using formal methods to the design of such systems stem from two aspects.…”

Section: Introductionmentioning

confidence: 99%

Towards Reliable E-Government Systems with the OTS/CafeOBJ Method

Kong

Ogata

Futatsugi

2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYSystem implementation for e-Government initiatives should be reliable. Unreliable system implementation could, on the one hand, be insufficient to fulfill basic system requirements, and more seriously on the other hand, break the trust of citizens on governments. The objective of this paper is to advocate the use of formal methods in general, the OTS/CafeOBJ method in particular in this paper, to help develop reliable system implementation for e-Government initiatives. An experiment with the OTS/CafeOBJ method on an e-Government messaging framework proposed for providing citizens with seamless public services is described to back up our advocation. Two previously not well-clarified problems of the framework and their potential harm realized in this experiment are reported, and possible ways of revisions to the framework are suggested as well. The revisions are proved to be sufficient for making the framework satisfy certain desired properties.

show abstract

“…The original refinement proofs using Z have been done on a very detailed level by hand [22]. [19] shows that the same verification can be done with good tool support and in a short period of time using KIV. The Mondex refinement basically splits a world view of an application into components implementing a protocol.…”

Section: Related Workmentioning

confidence: 99%

A Refinement Method for Java Programs

Grandy

Stenzel

Reif

2007

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We present a refinement method for Java programs which is motivated by the challenge of verifying security protocol implementations. The method can be used for stepwise refinement of abstract specifications down to the level of code running in the real application. The approach is based on a calculus for the verification of Java programs for the concrete level and Abstract State Machines for the abstract level. In this paper we illustrate our approach with the verification of a MCommerce application for buying movie tickets using a mobile phone written in J2ME. The approach uses the interactive theorem prover KIV [1].

show abstract

The Mondex Challenge: Machine Checked Proofs for an Electronic Purse

Cited by 29 publications

References 19 publications

Atomic actions, and their refinements to isolated protocols

Atomic actions, and their refinements to isolated protocols

Towards Reliable E-Government Systems with the OTS/CafeOBJ Method

A Refinement Method for Java Programs

Contact Info

Product

Resources

About