TL;DR
This paper introduces a symbolic automata-based formalism for monitoring logs with time and data parameters, enabling efficient online verification of complex specifications.
Contribution
It presents a novel formalism that handles both timing and data parameters symbolically, with an implementation demonstrating practical efficiency.
Findings
High expressive power of the formalism
Efficient online monitoring demonstrated
Prototype implementation shows practical viability
Abstract
Monitoring consists in deciding whether a log meets a given specification. In this work, we propose an automata-based formalism to monitor logs in the form of actions associated with time stamps and arbitrarily data values over infinite domains. Our formalism uses both timing parameters and data parameters, and is able to output answers symbolic in these parameters and in the log segments where the property is satisfied or violated. We implemented our approach in an ad-hoc prototype SyMon, and experiments show that its high expressive power still allows for efficient online monitoring.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
