Runtime Verification Through Forward Chaining
Alan Perotti, Guido Boella, Artur d'Avila Garcez
Electronic Proceedings in Theoretical Computer Science · 2014
doi:10.4204/eptcs.169.8 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this paper we present a novel rule-based approach for Runtime Verification of FLTL properties over finite but expanding traces. Our system exploits Horn clauses in implication form and relies on a forward chaining-based monitoring algorithm. This approach avoids the branching structure and exponential complexity typical of tableaux-based formulations, creating monitors with a single state and a fixed number of rules. This allows for a fast and scalable tool for Runtime Verification: we present the technical details together with a working implementation.
Abstract licence: CC BY-NC-ND
References17
17 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.