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
Designing and comparing automated test oracles for GUI-based software applications
Qing Xie,Atif M. Memon +1 more
TL;DR: This article shows that the test oracle, a mechanism that determines whether a software is executed correctly for a test case, also significantly impacts the fault detection effectiveness and cost of atest case.
Monitoring Metric First-Order Temporal Properties
TL;DR: The results show that metric first-order temporal logic can serve as an effective specification language for expressing and monitoring a wide variety of practically relevant system properties.
194
VESTA: A statistical model-checker and analyzer for probabilistic systems
Koushik Sen,Mahesh Viswanathan,Gul Agha +2 more
- 19 Sep 2005
TL;DR: A brief overview of a statistical model-checking and analysis tool VESTA, a tool for statistical analysis of probabilistic systems, which supports statistical model checking and statistical evaluation of expected values of temporal expressions.
A Tutorial on Runtime Verification
Yliès Falcone,Klaus Havelund,Giles Reger +2 more
- 01 Jan 2013
TL;DR: This chapter focuses specifically on checking execution traces against requirements formalized in terms of monitors, and shows on examples how such monitors can be written using aspect-oriented programming, exemplified by ASPECTJ.
Parametric Trace Slicing and Monitoring
Feng Chen,Grigore Rosu +1 more
- 27 Mar 2009
TL;DR: This foundational paper gives the first solution to parametric trace analysis that is unrestricted by the type of parametric properties or traces that can be analyzed, and confirms that the generality of the discussed techniques does not come at a performance expense when compared with existing monitoring systems.
References
Synthesizing Monitors for Safety Properties
Klaus Havelund,Grigore Rosu +1 more
- 08 Apr 2002
TL;DR: An algorithm which takes a past time LTL formula and generates an efficient dynamic programming algorithm is presented, which is to construct a flexible framework for monitoring and analyzing program executions.
Monitoring Java Programs with Java PathExplorer
Klaus Havelund,Grigore Rosu +1 more
- 01 Oct 2001
TL;DR: Recent work on the development of Java PathExplorer (\JPaXX), a tool for monitoring the execution of Java programs, can be used during program testing to gain increased information about program executions, and can potentially furthermore be applied during operation to survey safety critical systems.
311
Monitoring programs using rewriting
Klaus Havelund,Grigore Rosu +1 more
- 26 Nov 2001
TL;DR: A rewriting algorithm for efficiently testing future time Linear Temporal Logic formulae on finite execution traces using the Maude rewriting logic, which turns out to be a good notation and being supported by an efficient rewriting engine for performing these experiments.
Refutational theorem proving using term-rewriting systems
TL;DR: A canonical term-rewriting system for Boolean algebra is introduced, which enables the first-order predicate calculus to be transformed into a form of equational logic and several complete strategies for first- order theories based on the Knuth-Bendix Completion Procedure are developed.
231