Specification language for static and runtime verification of data and control properties
Paper in proceedings, 2015

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 dataoriented 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.

Author

Wolfgang Ahrendt

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Mauricio Chimento

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Gordon J. Pace

University of Malta

Gerardo Schneider

University of Gothenburg

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 9109 108-125

Areas of Advance

Information and Communication Technology

DOI

10.1007/978-3-319-19249-9_8

ISBN

978-3-319-19248-2

More information

Created

10/7/2017