Computer says no: verdict explainability for runtime monitors using a local proof system
type: Item
instance of: scholarly article
title: Computer says no: verdict explainability for runtime monitors using a local proof system
zbMATH Open document ID: 1455.68103
author: Adrian Francalanza
author: Clare Cini
published in: Journal of Logical and Algebraic Methods in Programming
publication date: 2021-02-26T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B44
zbMATH DE Number: 7316068
zbMATH Keywords: runtime verification
zbMATH Keywords: explainability
zbMATH Keywords: interpretability
zbMATH Keywords: linear temporal logic
zbMATH Keywords: proof systems
zbMATH Keywords: correct monitor synthesis
describes a project that uses: Easychair
MaRDI profile type: Publication
full work available at URL: j.jlamp.2020.100636
OpenAlex ID: W3112313904
cites work: A framework for parameterized monitorability
cites work: On the complexity of determinizing monitors
cites work: Recognizing safety and liveness
cites work: Combining test case generation and runtime verification
cites work: Q5322945
cites work: Optimal proofs for linear temporal logic on lasso words
cites work: Runtime verification of temporal properties over out-of-order data streams
cites work: Decentralised LTL monitoring
cites work: Comparing LTL Semantics for Runtime Verification
cites work: Monitoring networks through multiparty session types
cites work: Local model checking for infinite state spaces
cites work: Cut-free sequent systems for temporal logic
cites work: Handbook of proof theory
cites work: An LTL Proof System for Runtime Verification
cites work: Computer Aided Verification
cites work: A Theory of Monitors
cites work: Consistently-detecting monitors
cites work: Monitorability for the Hennessy-Milner logic with recursion
cites work: Distributed system contract monitoring
cites work: Monitors and blame assignment for higher-order session types
cites work: Constructive linear-time temporal logic: proof systems and Kripke semantics
cites work: Model checking of safety properties
cites work: A brief account of runtime verification
cites work: Completing the temporal picture
cites work: Timed runtime monitoring for multiparty conversations
cites work: A survey of challenges for runtime verification from advanced application domains (beyond software)
cites work: Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
cites work: Local model checking in the modal mu-calculus
cites work: Q4499084
DOI: 10.1016/J.JLAMP.2020.100636
description: scientific article; zbMATH DE number 7316068