Consistently-detecting monitors
From MaRDI portal
Publication:5111620
DOI10.4230/LIPICS.CONCUR.2017.8zbMATH Open1442.68107OpenAlexW2759563336MaRDI QIDQ5111620FDOQ5111620
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2017.8
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Stochastic Controllability of Systems with Multiple Delays in Control
- Safety, Liveness and Run-Time Refinement for Modular Process-Aware Information Systems with Dynamic Sub Processes
- Contract-based discovery of Web services modulo simple orchestrators
- Reactive Systems
- Results on the propositional \(\mu\)-calculus
- Reasoning about infinite computations
- Monitoring networks through multiparty session types
- Introduction to Bisimulation and Coinduction
- On Freeze LTL with Ordered Attributes
- Comparing LTL Semantics for Runtime Verification
- Testing equivalence as a bisimulation equivalence
- Symbolic bisimulations
- Confluence for process verification
- Enforcing Non-safety Security Policies with Program Monitors
- A theory of communicating processes with value passing
- Title not available (Why is that?)
- Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors
- The algorithmics of bisimilarity
- Monitors and blame assignment for higher-order session types
- General Algorithms for Testing the Ambiguity of Finite Automata
- Synthesising correct concurrent runtime monitors
- Runtime verification with minimal intrusion through parallelism
- On the complexity of determinizing monitors
- A Theory of Monitors
- Title not available (Why is that?)
- Monitorability for the Hennessy-Milner logic with recursion
- Computer Aided Verification
- Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings
- Title not available (Why is that?)
Cited In (10)
- Computer says no: verdict explainability for runtime monitors using a local proof system
- On bidirectional runtime enforcement
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- Bidirectional Runtime Enforcement of First-Order Branching-Time Properties
- A theory of monitors
- On first-order runtime enforcement of branching-time properties
- Monitoring for Silent Actions
- Title not available (Why is that?)
- An Operational Guide to Monitorability
- On probabilistic monitorability
Uses Software
This page was built for publication: Consistently-detecting monitors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111620)
