Open AccessJournal Article
Rule-based runtime verification
342
TL;DR: In this paper, a rule-based framework for defining and implementing finite trace monitoring logics, including future and past time temporal logic, extended regular expressions, real-time logics and interval logics is presented.
read more
Abstract: We present a rule-based framework for defining and implementing finite trace monitoring logics, including future and past time temporal logic, extended regular expressions, real-time logics, interval logics, forms of quantified temporal logics, and so on. Our logic, EAGLE, is implemented as a Java library and involves novel techniques for rule definition, manipulation and execution. Monitoring is done on a state-by-state basis, without storing the execution trace.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Processing flows of information: From data stream to complex event processing
TL;DR: A general, unifying model is proposed to capture the different aspects of an IFP system and use it to provide a complete and precise classification of the systems and mechanisms proposed so far.
1K
A Brief Account of Runtime Verification
TL;DR: A comparison to well-known verification techniques like model checking and testing is provided, and applications in which runtime verification brings out its distinguishing features are pointed out.
917
PeerReview: practical accountability for distributed systems
Andreas Haeberlen,Petr Kouznetsov,Peter Druschel +2 more
- 14 Oct 2007
TL;DR: It is demonstrated that PeerReview is practical by applying it to three different types of distributed systems: a network filesystem, a peer-to-peer system, and an overlay multicast system.
Introduction to runtime verification
Ezio Bartocci,Yliès Falcone,Adrian Francalanza,Giles Reger +3 more
- 01 Jan 2018
TL;DR: The aim of this chapter is to act as a primer for those wanting to learn about Runtime Verification, providing an overview of the main specification languages used for RV and introducing the standard terminology necessary to describe the monitoring problem.
Monitoring Algorithms for Metric Temporal Logic Specifications
Prasanna Thati,Grigore Rosu +1 more
TL;DR: Monitoring algorithms for checking timestamped execution traces against formulae in MTL or certain important sublogics of it are presented and lower bounds for the monitoring problem are presented, showing that the presented algorithms are asymptotically optimal.
221
References
•Proceedings Article
Runtime Assurance Based On Formal Specifications
Insup Lee,Sampath Kannan,Moonjoo Kim,Oleg Sokolsky,Mahesh Viswanathan +4 more
- 01 Jan 1999
TL;DR: The Monitoring and Checking (MaC) framework which assures the correctness of the current execution at run-time and two languages to specify monitoring scripts and requirements are presented.
Automata-based verification of temporal properties on running programs
Dimitra Giannakopoulou,Klaus Havelund +1 more
- 26 Nov 2001
TL;DR: An approach to checking a running program against Linear Temporal Logic specifications by translating LTL formulae to finite-state automata, which are used as observers of the program behavior.
The Temporal Rover and the ATG Rover
Doron Drusinsky
- 30 Aug 2000
TL;DR: 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.
Checking Finite Traces using Alternating Automata
Bernd Finkbeiner,Henny B. Sipma +1 more
TL;DR: An extension to these algorithms to check at runtime whether a reactive program satisfies a temporal specification, expressed by a future linear-time temporal logic formula is outlined, applicable to LTL formulas containing both past and future operators.