A Verified Proof Checker for Metric First-Order Temporal Logic (Q7361405)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry MFOTL_Checker
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Verified Proof Checker for Metric First-Order Temporal Logic |
AFP entry MFOTL_Checker |
Statements
16 April 2024
0 references
Andrei Herasimau
0 references
Jonathan Julian Huerta y Munive
0 references
Leonardo Lima
0 references
Martin Raszyk
0 references
Dmitriy Traytel
0 references
A Verified Proof Checker for Metric First-Order Temporal Logic (English)
0 references
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.
0 references
