A Theory of Monitors

DOI10.1007/978-3-662-49630-5_9zbMath1476.68172OpenAlexW2464216566MaRDI QIDQ2811337

Adrian Francalanza

Publication date: 10 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49630-5_9

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)

Related Items (10)

On the complexity of determinizing monitors ⋮ Monitorability for the Hennessy-Milner logic with recursion ⋮ On first-order runtime enforcement of branching-time properties ⋮ Lang-n-Send Extended: Sending Regular Expressions to Monitors ⋮ 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 ⋮ Consistently-detecting monitors ⋮ Monitoring for Silent Actions

Uses Software

• Java-MaC
• LOLA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesising correct concurrent runtime monitors
• Testing equivalences for processes
• Java-MaC: A run-time assurance approach for Java programs
• A brief account of runtime verification
• Distributed system contract monitoring
• A theory for observational fault tolerance
• A theory of contracts for web services
• A Distributed Pi-Calculus
• Comparing LTL Semantics for Runtime Verification
• Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors
• Mutually Testing Processes

This page was built for publication: A Theory of Monitors