Runtime verification with minimal intrusion through parallelism

DOI10.1007/S10703-015-0226-3zbMath1323.68363OpenAlexW1000312060MaRDI QIDQ888419

Sebastian Fischmeister, Shay Berkovich, Borzoo Bonakdarpour

Publication date: 30 October 2015

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-015-0226-3

zbMATH Keywords

parallel algorithmsformal methodstemporal logicruntime monitoring

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

On the complexity of determinizing monitors ⋮ Concurrency-preserving and sound monitoring of multi-threaded component-based systems: theory, algorithms, implementation, and evaluation ⋮ Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability ⋮ A theory of monitors ⋮ Consistently-detecting monitors

Uses Software

• Java-MOP
• Clara
• RiTHM

Cites Work

• Unnamed Item
• Scalable offline monitoring of temporal specifications
• Time-triggered runtime verification
• \textsc{InterAspect}: aspect-oriented instrumentation with GCC
• On Parallel Implementations of Deterministic Finite Automata
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Runtime verification with minimal intrusion through parallelism