Monitoring events that carry data

Klaus Havelund, Giles Reger*, Daniel Thoma, Eugen Zălinescu

*Corresponding author for this work
23 Citations (Scopus)


Very early runtime verification systems focused on monitoring what we can refer to as propositional events: just names of events. For this, finite state machines, standard regular expressions, or propositional temporal logics were sufficient formalisms for expressing properties. However, in practice there is a need for monitoring events that in addition carry data arguments. This adds complexity to both the property specification languages, and monitoring algorithms, which is reflected in the many alternative such approaches suggested in the literature. This chapter presents five different formalisms and monitoring approaches that support specifications with data, in order to illustrate the challenges and various solutions.

Original languageEnglish
Title of host publicationLectures on Runtime Verification
EditorsEzio Bartocci, Yliès Falcone
Number of pages42
Volume10457 LNCS
PublisherSpringer Verlag
Publication date11.02.2018
ISBN (Print)978-3-319-75631-8
ISBN (Electronic)978-3-319-75632-5
Publication statusPublished - 11.02.2018


Dive into the research topics of 'Monitoring events that carry data'. Together they form a unique fingerprint.

Cite this