Runtime Verification Through Forward Chaining

@inproceedings{Perotti2014RuntimeVT,
  title={Runtime Verification Through Forward Chaining},
  author={Alan Perotti and Guido Boella and Artur S. d'Avila Garcez},
  booktitle={HCVS},
  year={2014}
}
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… 
View PDF on arXiv
1 Citations

Figures and Tables from this paper

One Citation

Citation Type

Citation Type

State and parameter estimation of the AquaCrop model for winter wheat using sensitivity informed particle filter

References

SHOWING 1-10 OF 28 REFERENCES
Runtime Verification Through Forward Chaining
TLDR
This system exploits Horn clauses in implication form and relies on a forward chaining-based monitoring algorithm to create monitors with a single state and a fixed number of rules for Runtime Verification of FLTL properties over finite but expanding traces.
A brief account of runtime verification
Reasoning with Temporal Logic on Truncated Paths
TLDR
This work presents a formalism for reasoning about truncated paths, and analyzes its characteristics.
Monitoring of Real-Time Properties
TLDR
A 3-valued semantics (true, false, inconclusive) for LTL and TLTL on finite traces is defined that resembles the infinite trace semantics in a suitable and intuitive manner.
Rule Systems for Run-time Monitoring: from Eagle to RuleR
TLDR
RuleR is introduced, a primitive conditional rule-based system, which has a simple and easily implemented algorithm for effective run-time checking, and into which one can compile a wide range of temporal logics and other specification formalisms used for run- time verification.
The Glory of the Past
TLDR
The notion of α-fairness is presented which is proved to fully capture the behavior of probabilistic finite state programs.
The temporal logic of programs
  • A. Pnueli
  • Computer Science
    18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
A unified approach to program verification is suggested, which applies to both sequential and parallel programs. The main proof method suggested is that of temporal reasoning in which the time…
The Denotational Semantics of Horn Clauses as a Production System
We show how one of Nilsson's tenets on rule-based production systems, when applied to Horn clause programs, leads to a denotational semantics. This formalism, in turn provides a striking illustration…
The Temporal Rover and the ATG Rover
TLDR
The Temporal Rover is a specification based verification tool for applications written in C, C++, Java, Verilog and VHDL that generates executable code from LTL and MTL assertions written as comments in the source code.
The Semantics of Predicate Logic as a Programming Language
TLDR
In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated, and it is concluded that operational semantics is a part ofProof theory and that fixpoint semantic is a special case of model-theoretic semantics.
...
1
2
3
...