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