Skip to Main content Skip to Navigation
Conference papers

Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors

Abstract : Runtime verification is the process of checking a property on a trace of events produced by the execution of a computational system. Runtime verification techniques have recently focused on parametric specifications where events take data values as parameters. These techniques exist on a spectrum inhabited by both efficient and expressive techniques. These characteristics are usually shown to be conflicting - in state-of-the-art solutions, efficiency is obtained at the cost of loss of expressiveness and vice-versa. To seek a solution to this conflict we explore a new point on the spectrum by defining an alternative runtime verification approach. We introduce a new formalism for concisely capturing expressive specifications with parameters. Our technique is more expressive than the currently most efficient techniques while at the same time allowing for optimizations.
Document type :
Conference papers
Complete list of metadatas
Contributor : Yliès Falcone <>
Submitted on : Monday, September 9, 2013 - 11:01:53 AM
Last modification on : Monday, July 20, 2020 - 4:24:02 PM

Links full text




Howard Barringer, Yliès Falcone, Klaus Havelund, Giles Reger, David E. Rydeheard. Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors. FM 2012 - 18th International Symposium on Formal Methods, Aug 2012, Paris, France. pp.68-84, ⟨10.1007/978-3-642-32759-9_9⟩. ⟨hal-00857285⟩



Record views