An LTL Proof System for Runtime Verification

DOI10.1007/978-3-662-46681-0_54zbMath1420.68121OpenAlexW2399995426MaRDI QIDQ5194962

Adrian Francalanza, Clare Cini

Publication date: 17 September 2019

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46681-0_54

zbMATH Keywords

linear temporal logicproof systemproof treedeductive systemproof obligation

Mathematics Subject Classification ID

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

Related Items (6)

Probabilistic causes in Markov chains ⋮ Monitorability for the Hennessy-Milner logic with recursion ⋮ Unnamed Item ⋮ Computer says no: verdict explainability for runtime monitors using a local proof system ⋮ A theory of monitors ⋮ Certifying proofs for SAT-based model checking

This page was built for publication: An LTL Proof System for Runtime Verification