Computer says no: verdict explainability for runtime monitors using a local proof system
DOI10.1016/J.JLAMP.2020.100636zbMATH Open1455.68103OpenAlexW3112313904MaRDI QIDQ1996872FDOQ1996872
Authors: Adrian Francalanza, Clare Cini 
Publication date: 26 February 2021
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2020.100636
Recommendations
- An LTL proof system for runtime verification
- Runtime verification using the temporal description logic \(\mathcal{ALC}\)-LTL revisited
- Runtime verification monitor construction for three-valued PPTL
- Symbolic runtime verification for monitoring under uncertainties and assumptions
- Impartial Anticipation in Runtime-Verification
interpretabilityruntime verificationlinear temporal logicproof systemsexplainabilitycorrect monitor synthesis
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Title not available (Why is that?)
- Handbook of proof theory
- Title not available (Why is that?)
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- A brief account of runtime verification
- Reasoning with temporal logic on truncated paths.
- Cut-free sequent systems for temporal logic
- Monitoring networks through multiparty session types
- Comparing LTL semantics for runtime verification
- Model checking of safety properties
- Recognizing safety and liveness
- Local model checking in the modal mu-calculus
- Completing the temporal picture
- Monitors and blame assignment for higher-order session types
- Combining test case generation and runtime verification
- Local model checking for infinite state spaces
- Distributed system contract monitoring
- Constructive linear-time temporal logic: proof systems and Kripke semantics
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- A framework for parameterized monitorability
- On the complexity of determinizing monitors
- Timed runtime monitoring for multiparty conversations
- A theory of monitors (extended abstract)
- Runtime verification of temporal properties over out-of-order data streams
- Monitorability for the Hennessy-Milner logic with recursion
- Consistently-detecting monitors
- An LTL proof system for runtime verification
- Optimal proofs for linear temporal logic on lasso words
Cited In (5)
Uses Software
This page was built for publication: Computer says no: verdict explainability for runtime monitors using a local proof system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996872)
