Zhe Chen
Yifan Wu
ABSTRACT
An important problem in runtime verification is monitorability. If a property is not monitorable, then it is meaningless to check it at runtime, as no satisfaction or violation will be reported in finite steps. In this paper, we revisit the classic definition of monitorability, and show that it is too restrictive for practical runtime verification. We propose a weaker but more practical definition of monitorability, say weak monitorability, and show how to decide weak monitorability for runtime verification.
- Andreas Bauer. 2010. Monitorability of omega-regular languages. CoRR abs/1006.3638 (2010).Google Scholar
- Andreas Bauer, Martin Leucker, and Christian Schallhart. 2007. The Good, the Bad, and the Ugly, But How Ugly Is Ugly?. In Proceedings of the 7th International Workshop on Runtime Verification, RV 2007 (Lecture Notes in Computer Science), Vol. 4839. Springer, 126--138. Google ScholarDigital Library
- Andreas Bauer, Martin Leucker, and Christian Schallhart. 2011. Runtime Verification for LTL and TLTL. ACM Transactions on Software Engineering and Methodology (TOSEM) 20, 4 (2011), 14. Google ScholarDigital Library
- Zhe Chen, Zhemin Wang, Yunlong Zhu, Hongwei Xi, and Zhibin Yang. 2016. Parametric Runtime Verification of C Programs. In Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2016) (Lecture Notes in Computer Science), Vol. 9--636. Springer, 299--315. Google ScholarDigital Library
- Martin Leucker and Christian Schallhart. 2009. A brief account of runtime verification. Journal of Logic and Algebraic Programming 78, 5 (2009), 293--303.Google ScholarCross Ref
- Amir Pnueli and Aleksandr Zaks. 2006. PSL Model Checking and Run-Time Verification Via Testers. In Proceedings of the 14th International Symposium on Formal Methods, FM 2006 (Lecture Notes in Computer Science), Vol. 4085. Springer, 573--586. Google ScholarDigital Library
Index Terms
- Deciding weak monitorability for runtime verification
Recommendations
Model-based Runtime Verification Framework
Model-based runtime verification is an extension to the state-of-the-art runtime verification, aimed at checking at runtime the system implementation against the system model (consistency checking) and the system model against the system specification (...
Introduction to the special section on runtime verification
Runtime verification is a relatively recent area of research that concentrates on checking system execution against formally specified behavioral properties. Primary research directions in runtime verification include logics for monitoring, online ...
Decentralized Asynchronous Crash-resilient Runtime Verification
Runtime verification is a lightweight method for monitoring the formal specification of a system during its execution. It has recently been shown that a given state predicate can be monitored consistently by a set of crash-prone asynchronous distributed ...
Comments