Assumption-based runtime verification

DOI10.1007/s10703-023-00416-zOpenAlexW4360938682MaRDI QIDQ6102167

Alessandro Cimatti, Stefano Tonetta, Chun Tian

Publication date: 8 May 2023

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

Full work available at URL: https://doi.org/10.1007/s10703-023-00416-z

zbMATH Keywords

linear temporal logicpartial observabilityruntime verificationpredictive semanticsresettable monitors

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decentralised LTL monitoring
• Organising LTL monitors over distributed systems with a global clock
• Predictability of event occurrences in partially-observed discrete-event systems
• The complexity of reasoning about knowledge and time. I: Lower bounds
• Symbolic model checking: \(10^{20}\) states and beyond
• Verification of reactive systems. Formal methods and algorithms.
• An overview of the runtime verification tool Java PathExplorer
• First-order temporal logic monitoring with BDDs
• A brief account of runtime verification
• Model-based testing of reactive systems. Advanced lectures.
• Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
• Comparing LTL Semantics for Runtime Verification
• Parametric Trace Slicing and Monitoring
• Handbook of Model Checking
• Diagnosability of discrete-event systems
• From LTL to rLTL monitoring
• From Model Checking to a Temporal Proof for Partial Models
• Trace-Length Independent Runtime Monitoring of Quantitative Policies in LTL
• Software model checking
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation
• Refining the safety-liveness classification of temporal properties according to monitorability

This page was built for publication: Assumption-based runtime verification