Assumption-based runtime verification
From MaRDI portal
Recommendations
Cites work
- A brief account of runtime verification
- An overview of the runtime verification tool Java PathExplorer
- Comparing LTL semantics for runtime verification
- Diagnosability of discrete-event systems
- First-order temporal logic monitoring with BDDs
- From LTL to rLTL monitoring
- From Model Checking to a Temporal Proof for Partial Models
- Handbook of model checking
- scientific article; zbMATH DE number 2080059 (Why is no real title available?)
- scientific article; zbMATH DE number 3993549 (Why is no real title available?)
- scientific article; zbMATH DE number 234014 (Why is no real title available?)
- Improving automata generation for linear temporal logic by considering the automaton hierarchy
- Model-based testing of reactive systems. Advanced lectures.
- Organising LTL monitors over distributed systems with a global clock
- Parametric Trace Slicing and Monitoring
- Predictability of event occurrences in partially-observed discrete-event systems
- Refining the safety-liveness classification of temporal properties according to monitorability
- Software model checking
- Symbolic model checking: \(10^{20}\) states and beyond
- The complexity of reasoning about knowledge and time. I: Lower bounds
- Trace-length independent runtime monitoring of quantitative policies in LTL
- Verification of reactive systems. Formal methods and algorithms.
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
Cited in
(4)
This page was built for publication: Assumption-based runtime verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102167)