Worst-Case Execution Time Calculation for Query-Based Monitors by Witness Generation
M\'arton B\'ur, Krist\'of Marussy, Brett H. Meyer, D\'aniel, Varr\'o

TL;DR
This paper introduces a semantic-aware static analysis method to accurately estimate the worst-case execution time of graph-query-based runtime monitors in cyber-physical systems, enhancing safety guarantees in real-time applications.
Contribution
It presents a novel WCET estimation technique that leverages domain-specific information and witness generation to produce tight, safe execution time bounds for data-driven monitoring programs.
Findings
Generated witness models reveal worst-case execution scenarios.
The approach produces tighter WCET bounds than existing static analyzers.
Experimental results validate the method's effectiveness on real-time platforms.
Abstract
Runtime monitoring plays a key role in the assurance of modern intelligent cyber-physical systems, which are frequently data-intensive and safety-critical. While graph queries can serve as an expressive yet formally precise specification language to capture the safety properties of interest, there are no timeliness guarantees for such auto-generated runtime monitoring programs, which prevents their use in a real-time setting. While worst-case execution time (WCET) bounds derived by existing static WCET estimation techniques are safe, they may not be tight as they are unable to exploit domain-specific (semantic) information about the input models. This paper presents a semantic-aware WCET analysis method for data-driven monitoring programs derived from graph queries. The method incorporates results obtained from low-level timing analysis into the objective function of a modern graph…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
