English

Dynamically Reprogrammable Runtime Monitors for Bounded-time MTL

Logic in Computer Science 2026-03-23 v1 Formal Languages and Automata Theory

Abstract

A Runtime Verification (RV) framework that supports online, at-speed verification of properties that can change dynamically (during in-field operations) will benefit a large variety of applications. Several state-of-the-art RV frameworks propose to implement monitors on FPGAs. While this approach can support changes to the property being monitored during in-field operations, they struggle to keep pace with the system under verification which use high-performance processors. In this work, we propose a novel, reprogrammable monitor that is implemented using standard cells instead of FPGAs. This allows the monitor to be co-located with the system under verification (on the same die), and hence is amenable to at-speed monitoring of properties. Our proposed design consists of a programmable unit that implements five basic operations and a set of queue-update rules. We show that a composition of such programmable units faithfully implements discrete time, bounded MTL. We demonstrate through simulations that our proposed monitor can be reprogrammed (through its I/O pins) post deployment. A fairly large monitor which can support MTL formulae upto 16 atomic propositions occupies only 0.55 mm^2, while operating at a frequency of 1.25 GHz.

Keywords

Cite

@article{arxiv.2603.19851,
  title  = {Dynamically Reprogrammable Runtime Monitors for Bounded-time MTL},
  author = {Chirantan Hebballi and Akash Poptani and Amrutha Benny and Rajshekar Kalayappan and Sandeep Chandran and Ramchandra Phawade},
  journal= {arXiv preprint arXiv:2603.19851},
  year   = {2026}
}
R2 v1 2026-07-01T11:29:38.802Z