Towards partial monitoring: Never too early to give in

Runtime Verification is a lightweight formal verification technique used to verify whether a system behaves as expected at runtime. Expected behaviour is typically formally specified using properties, which are used to automatically synthesise monitors. Properties that can be verified at runtime by a monitor are called monitorable , while those that cannot are termed non-monitorable . In this paper, we revisit the notion of monitorability and demonstrate how non-monitorable properties can still be used to generate partial monitors. We tackle this from two different perspectives: (i) by recognising that a monitor can give up on monitoring the property under analysis if it recognises that the monitoring will never conclude the satisfaction or violation of the property; (ii) by recognising that a monitor can give up on events that are not necessary for successful monitoring of the property under analysis. By considering these two aspects, we present how to achieve partial monitoring of Linear Temporal Logic properties by building upon the standard monitor construction. Finally, we present a prototype implementation of our approach and its application to a remote inspection case study, as well as a set of evaluation experiments to stress test our approach using synthetic properties. • How to extend standard monitor construction to handle non-monitorable properties. • Non-monitorable properties can be partially monitored. • Tackling partial monitorability directly on the monitor makes the approach formalism-agnostic. • A monitor can give up on a property if it recognises it will never conclude its verification. • A monitor can give up on events if such events are not of interest for the verification of the property.

Authors

Institutions

Publication Details

Journal
Science of Computer Programming
Published
2024-10-17
DOI
https://doi.org/10.1016/j.scico.2024.103220
Citations
3
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
1.08
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Towards partial monitoring: Never too early to give in

Angelo Ferrando, Rafael C. Cardoso
3 citations
Science of Computer Programming
Formal Methods in Verification
1.08
article

Towards partial monitoring: Never too early to give in

Angelo Ferrando, Rafael C. Cardoso
article en
3 citations

Abstract

Runtime Verification is a lightweight formal verification technique used to verify whether a system behaves as expected at runtime. Expected behaviour is typically formally specified using properties, which are used to automatically synthesise monitors. Properties that can be verified at runtime by a monitor are called monitorable , while those that cannot are termed non-monitorable . In this paper, we revisit the notion of monitorability and demonstrate how non-monitorable properties can still be used to generate partial monitors. We tackle this from two different perspectives: (i) by recognising that a monitor can give up on monitoring the property under analysis if it recognises that the monitoring will never conclude the satisfaction or violation of the property; (ii) by recognising that a monitor can give up on events that are not necessary for successful monitoring of the property under analysis. By considering these two aspects, we present how to achieve partial monitoring of Linear Temporal Logic properties by building upon the standard monitor construction. Finally, we present a prototype implementation of our approach and its application to a remote inspection case study, as well as a set of evaluation experiments to stress test our approach using synthetic properties. • How to extend standard monitor construction to handle non-monitorable properties. • Non-monitorable properties can be partially monitored. • Tackling partial monitorability directly on the monitor makes the approach formalism-agnostic. • A monitor can give up on a property if it recognises it will never conclude its verification. • A monitor can give up on events if such events are not of interest for the verification of the property.

Science of Computer ProgrammingVol. 240
University of Modena and Reggio Emilia (IT), University of Aberdeen (GB)
Climate action
Openalex Percentile: Top 20%
Formal Methods in Verification
1.08
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Towards partial monitoring: Never too early to give in — Angelo Ferrando, Rafael C. Cardoso · Science of Computer Programming (2024) | TGRS Research Map | TGRS