Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors

Résumé

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.

Dates et versions

hal-00857285 , version 1 (09-09-2013)

Identifiants

Citer

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⟩
177 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More