Consistently-detecting monitors

DOI10.4230/LIPICS.CONCUR.2017.8MaRDI QIDQ5111620zbMATH OpenOpenAlexFDO

Authors Adrian Francalanza

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPIcs.CONCUR.2017.8

zbMATH Keywords

controllabilitycompositional reasoningsymbolic analysisruntime monitoringdeterministic behaviour

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A theory of monitors
• A theory of monitors (extended abstract)
• On the complexity of determinizing monitors
• A theory of register monitors
• Determinizing monitors for HML with recursion

Cites work

• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 3978429 (Why is no real title available?)
• scientific article; zbMATH DE number 1086679 (Why is no real title available?)
• A theory of communicating processes with value passing
• A theory of monitors (extended abstract)
• Comparing LTL semantics for runtime verification
• Computer Aided Verification
• Confluence for process verification
• Contract-based discovery of Web services modulo simple orchestrators
• Decentralized asynchronous crash-resilient runtime verification
• Enforcing non-safety security policies with program monitors
• General Algorithms for Testing the Ambiguity of Finite Automata
• Introduction to bisimulation and coinduction
• Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings
• Monitorability for the Hennessy-Milner logic with recursion
• Monitoring networks through multiparty session types
• Monitors and blame assignment for higher-order session types
• On freeze LTL with ordered attributes
• On the complexity of determinizing monitors
• Quantified event automata: towards expressive and efficient runtime monitors
• Reactive Systems
• Reasoning about infinite computations
• Results on the propositional \(\mu\)-calculus
• Runtime verification with minimal intrusion through parallelism
• Safety, liveness and run-time refinement for modular process-aware information systems with dynamic sub processes
• Stochastic Controllability of Systems with Multiple Delays in Control
• Symbolic bisimulations
• Synthesising correct concurrent runtime monitors
• Testing equivalence as a bisimulation equivalence
• The algorithmics of bisimilarity

Cited in

(12)

• An Operational Guide to Monitorability
• On probabilistic monitorability
• A theory of monitors (extended abstract)
• Computer says no: verdict explainability for runtime monitors using a local proof system
• On bidirectional runtime enforcement
• Monitoring for silent actions
• On runtime enforcement via suppressions
• 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
• Determinizing monitors for HML with recursion
• On first-order runtime enforcement of branching-time properties

Describes a project that uses

Uses Software

• Java-MOP

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)