Please use this identifier to cite or link to this item:
|Title:||Fast-forward runtime monitoring - an industrial case study|
|Other Titles:||Runtime verification. RV 2012. Lecture notes in computer science|
Pace, Gordon J.
|Keywords:||Computer software -- Verification|
Computer software -- Testing
Autonomous distributed systems
Computer network architectures
|Publisher:||Springer, Berlin, Heidelberg|
|Citation:||Colombo C., & Pace G. J. (2012). Fast-forward runtime monitoring - an industrial case study. In S. Qadeer, & S. Tasiran (Eds.), Runtime Verification. RV 2012. Lecture Notes in Computer Science. Heidelberg: Springer, Berlin.|
|Abstract:||Amongst the challenges of statefully monitoring large-scale industrial systems is the ability to efficiently advance the monitors to the current state of the system. This problem presents itself under various guises such as when a monitoring system is being deployed for the first time, when monitors are changed and redeployed, and when asynchronous monitors fall too much behind the system. We propose fast-forward monitoring — a means of reaching the monitoring state at a particular point in time in an efficient manner, without actually traversing all the transitions leading to that state, and which we applied to a financial transaction system with millions of transactions already affected. In this paper we discuss our experience and present a generic theory of monitor fast-forwarding instantiating it for efficient monitor deployment in real-life systems.|
|Appears in Collections:||Scholarly Works - FacICTCS|
Files in This Item:
|454.47 kB||Adobe PDF||View/Open Request a copy|
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.