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.
CITATION STYLE
Havelund, K., Reger, G., Thoma, D., & Zălinescu, E. (2018). Monitoring events that carry data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10457 LNCS, pp. 61–102). Springer Verlag. https://doi.org/10.1007/978-3-319-75632-5_3
Mendeley helps you to discover research relevant for your work.