Towards proof-theoretic interpretations for LTL monitoring
Year: 2012
Type: conference-paper
Abstract: In this talk we will present a study on how runtime verification (RV) algorithms can be given one common proof-theoretic interpretation. In RV, there is a lot of work that deals with verification algorithms, yet there is no standard notation for such algorithms making it hard to understand and compare such work.
Source: OAR@UM (University of Malta)
Authors: Clare Cini, Adrian Francalanza
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2766977590
