Formalization of a Monitoring Algorithm for Metric First-Order Temporal Logic

Title:	Formalization of a Monitoring Algorithm for Metric First-Order Temporal Logic
Authors:	Joshua Schneider and Dmitriy Traytel
Submission date:	2019-07-04
Abstract:	A monitor is a runtime verification tool that solves the following problem: Given a stream of time-stamped events and a policy formulated in a specification language, decide whether the policy is satisfied at every point in the stream. We verify the correctness of an executable monitor for specifications given as formulas in metric first-order temporal logic (MFOTL), an expressive extension of linear temporal logic with real-time constraints and first-order quantification. The verified monitor implements a simplified variant of the algorithm used in the efficient MonPoly monitoring tool. The formalization is presented in a RV 2019 paper, which also compares the output of the verified monitor to that of other monitoring tools on randomly generated inputs. This case study revealed several errors in the optimized but unverified tools.
Change history:	[2020-08-13]: added the formalization of the abstract slicing framework and joint data slicer (revision b1639ed541b7)
BibTeX:	@article{MFOTL_Monitor-AFP, author = {Joshua Schneider and Dmitriy Traytel}, title = {Formalization of a Monitoring Algorithm for Metric First-Order Temporal Logic}, journal = {Archive of Formal Proofs}, month = jul, year = 2019, note = {\url{https://isa-afp.org/entries/MFOTL_Monitor.html}, Formal proof development}, ISSN = {2150-914x}, }
License:	BSD License
Depends on:	Containers
Used by:	Generic_Join, MFODL_Monitor_Optimized
Status: [ok]	This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Proof outline
Proof document

Browse theories

Download this entry