pith. sign in

arxiv: 1412.1156 · v1 · pith:SYUQUKP2new · submitted 2014-12-03 · 💻 cs.LO

Runtime Verification Through Forward Chaining

classification 💻 cs.LO
keywords runtimeverificationapproachforwardalgorithmallowsavoidsbranching
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.