A Verified Proof Checker for Metric First-Order Temporal Logic

Andrei Herasimau, Jonathan Julian Huerta y Munive 📧, Leonardo Lima, Martin Raszyk 📧 and Dmitriy Traytel 🌐

April 16, 2024

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


Metric first-order temporal logic (MFOTL) is an expressive formalism for specifying temporal and data-dependent constraints on streams of time-stamped, data-carrying events. Recently, we have developed a monitoring algorithm that not only outputs the satisfaction or violation of MFOTL formulas but also explains its verdicts in the form of proof trees. These explanations serve as certificates, and in this entry we verify the correctness of a certificate checker. The checker is used to certify the output of our new, unverified monitoring tool WhyMon. The formalization contains another unverified, executable implementation of an explanation-producing monitoring algorithm used to exemplify our checker.


BSD License


Related publications

Session MFOTL_Checker