The ins and outs of first-order runtime verification

DOI10.1007/s10703-015-0227-2zbMath1341.68116OpenAlexW1965740447MaRDI QIDQ888417

Jan-Christoph Küster, Andreas Bauer, Gil Vegliach

Publication date: 30 October 2015

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-015-0227-2

zbMATH Keywords

first-order logictemporal logicmonitoringmonitorabilityspawning automatatrace-length independence

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (2)

Axiomatizing recursion-free, regular monitors ⋮ A formally verified, optimized monitor for metric first-order dynamic logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• Planning for temporally extended goals.
• On the feasibility of checking temporal integrity constraints
• A First-Order Policy Language for History-Based Transaction Monitoring
• Solving SAT and SAT Modulo Theories
• Impartial Anticipation in Runtime-Verification
• Temporal Assertions with Parametrized Propositions
• Parametric Trace Slicing and Monitoring
• The complexity of propositional linear temporal logics
• Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
• CONCUR 2003 - Concurrency Theory
• Computer Aided Verification

This page was built for publication: The ins and outs of first-order runtime verification