The ins and outs of first-order runtime verification
type: Item
instance of: scholarly article
title: The ins and outs of first-order runtime verification
zbMATH Open document ID: 1341.68116
author: Andreas Bauer
author: Jan-Christoph Küster
author: Gil Vegliach
published in: Formal Methods in System Design
publication date: 2015-10-30T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6502572
zbMATH Keywords: monitoring
zbMATH Keywords: spawning automata
zbMATH Keywords: temporal logic
zbMATH Keywords: first-order logic
zbMATH Keywords: monitorability
zbMATH Keywords: trace-length independence
MaRDI profile type: Publication
full work available at URL: s10703-015-0227-2
OpenAlex ID: W1965740447
cites work: Impartial Anticipation in Runtime-Verification
cites work: A First-Order Policy Language for History-Based Transaction Monitoring
cites work: On the feasibility of checking temporal integrity constraints
cites work: Q5322945
cites work: CONCUR 2003 - Concurrency Theory
cites work: The complexity of propositional linear temporal logics
cites work: Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds
cites work: Computer Aided Verification
cites work: Elements of finite model theory.
cites work: Q3862379
cites work: Planning for temporally extended goals.
cites work: Temporal Assertions with Parametrized Propositions
cites work: Parametric Trace Slicing and Monitoring
cites work: Solving SAT and SAT Modulo Theories
cites work: Q4198056
DOI: 10.1007/S10703-015-0227-2
description: scientific article; zbMATH DE number 6502572