Runtime Verification of Timed LTL using Disjunctive Normalized Equation Systems
TLDR
A characterization of Runtime Verification is proposed and the challenges in developing a method which is both sound and complete while at the same time efficient are addressed.About:
This article is published in Electronic Notes in Theoretical Computer Science.The article was published on 2003-10-01 and is currently open access. It has received 51 citations till now. The article focuses on the topics: Runtime verification & Disjunctive normal form.read more
Citations
More filters
Book ChapterDOI
Monitoring Temporal Properties of Continuous Signals
Oded Maler,Dejan Nickovic +1 more
TL;DR: A variant of temporal logic tailored for specifying desired properties of continuous signals, based on a bounded subset of the real-time logic mitl, augmented with a static mapping from continuous domains into propositions is introduced.
Journal ArticleDOI
Robustness of temporal logic specifications for continuous-time signals
TL;DR: This paper proposes multi-valued semantics for MTL formulas, which capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance, @e, from unsatisfiability.
Book ChapterDOI
Rule-Based Runtime Verification
TL;DR: Eagles logic, Eagle, is implemented as a Java library and involves novel techniques for rule definition, manipulation and execution for finite trace monitoring logics, including future and past time temporal logic, extended regular expressions, real-time logics and forms of quantified temporal logics.
Journal Article
Rule-based runtime verification
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.
Book ChapterDOI
Robustness of temporal logic specifications
TL;DR: This paper defines robust, multi-valued semantics for MTL formulas, which capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance, e, from unsatisfiability.
References
More filters
Journal ArticleDOI
A lattice-theoretical fixpoint theorem and its applications
TL;DR: In this paper, the authors formulate and prove an elementary fixpoint theorem which holds in arbitrary complete lattices, and give various applications (and extensions) of this result in the theories of simply ordered sets, real functions, Boolean algebras, as well as in general set theory and topology.
Book ChapterDOI
Simple on-the-fly automatic verification of linear temporal logic
TL;DR: A tableau-based algorithm for obtaining an automaton from a temporal logic formula that can be constructed simultaneously with, and guided by, the generation of the model, and which can be used in model checking in an “on-the-fly” fashion.
Journal ArticleDOI
Monitoring Java Programs with Java PathExplorer
Klaus Havelund,Grigore Rosu +1 more
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.
Proceedings ArticleDOI
Automata-based verification of temporal properties on running programs
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.