A Specification Language for Static and Runtime Verification of Data and Control Properties

Wolfgang Ahrendt, Jesus Mauricio Chimento, Gordon J. Pace, Gerardo Schneider

Static verification techniques can verify properties across all executions of a program,
but powerful judgements are hard to achieve automatically. In contrast, runtime verification
enjoys full automation, but cannot judge future and alternative runs.  In this paper we
present a novel approach in which data-centric and control-oriented properties may be stated
in a single formalism, amenable to both static and dynamic verification techniques. We develop
and formalise a specification notation, ppDATE, extending the control-flow property language
used in the runtime verification tool LARVA with pre/post-conditions and show how
specifications written in this notation can be analysed both using the deductive theorem
prover KeY and the runtime verification tool LARVA. Verification is performed in two steps:
KeY first partially proves the data-oriented part of the specification, simplifying the
specification which is then passed on to LARVA to check at runtime for the remaining parts
of the specification including the control-centric aspects. We apply the approach to Mondex,
an electronic purse application.