Please use this identifier to cite or link to this item:
|Title:||A specification language for static and runtime verification of data and control properties|
|Other Titles:||FM 2015 : formal methods. FM 2015. Lecture notes in computer science|
Chimento, Jesus Mauricio
Pace, Gordon J.
|Keywords:||Computer software -- Verification|
Computer software -- Testing
Autonomous distributed systems
Computer network architectures
|Citation:||Ahrendt W., Chimento J. M., Pace G. J., Schneider G. (2015) A specification language for static and runtime verification of data and control properties. In N. Bjørner, & F. de Boer (Eds.), FM 2015: formal methods. FM 2015. Lecture notes in computer science (pp. 1-18). Springer, Cham.|
|Abstract:||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.|
|Appears in Collections:||Scholarly Works - FacICTCS|
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.