rv12

Bartocci/Grosu/Karmarkar/Smolka/Stoller/Zadok/Seyster

Adaptive Runtime Verification.*

E. Bartocci, J. Seyster, R. Grosu, K. Havelund, S.A. Smolka, S.D. Stoller, E. Zadok and J. Seyster


We present Adaptive Runtime Verification (ARV), a new approach to runtime verification in which overhead control, runtime verification with state estimation, and predictive analysis are synergistically combined. Overhead control maintains the overhead of runtime verification at a specified target level, by enabling and disabling monitoring of events for each monitor instance as needed. In ARV, predictive analysis based on a probabilistic model of the monitored system is used to estimate how likely each monitor instance is to violate a given temporal property in the near future, and these criticality levels are fed to the overhead controllers, which allocate a larger fraction of the target overhead to monitor instances with higher criticality, thereby increasing the probability of violation detection. Since overhead control causes the monitor to miss events, we use Runtime Verification with State Estimation (RVSE) to estimate the probability that a property is satisfied by an incompletely monitored run. A key aspect of the ARV framework is a new algorithm for RVSE that performs the calculations offline, dramatically reducing the runtime overhead of RVSE, at the cost of introducing some approximation error. We demonstrate the utility of ARV on a significant case study involving runtime monitoring of concurrency errors in the Linux kernel.

In Proc. of RV'12, the 3rd International Conference on Runtime Verification, Istambul, Turkey, September, 2012, Springer LNCS.

*This work was supported by NSF Expeditions Award CNS-09-26190, the NSF CSR-AES05-09230 Award and the AFOSR FA-0550-09-1-0481 Award.