Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors

DOI10.1007/978-3-642-32759-9_9zbMath1372.68154OpenAlexW2132281483MaRDI QIDQ4647831

Yliès Falcone, Giles Reger, Klaus Havelund, Howard Barringer, David E. Rydeheard

Publication date: 8 November 2012

Published in: FM 2012: Formal Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32759-9_9

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (19)

Axiomatizing recursion-free, regular monitors ⋮ On the complexity of determinizing monitors ⋮ Monitorability for the Hennessy-Milner logic with recursion ⋮ Formal analysis and offline monitoring of electronic exams ⋮ Sound concurrent traces for online monitoring ⋮ From LTL to rLTL monitoring: improved monitorability through robust semantics ⋮ Formal verification for event stream processing: model checking of BeepBeep stream processing pipelines ⋮ Early detection of temporal constraint violations ⋮ Unnamed Item ⋮ Runtime enforcement of timed properties revisited ⋮ Monitoring hyperproperties ⋮ Runtime Verification: Passing on the Baton ⋮ A Context-Free Symbiosis of Runtime Verification and Automata Learning ⋮ Monitoring Metric First-Order Temporal Properties ⋮ A Theory of Monitors ⋮ A theory of monitors ⋮ Consistently-detecting monitors ⋮ An automata-theoretic approach to model-checking systems and specifications over infinite data domains ⋮ A formally verified, optimized monitor for metric first-order dynamic logic

This page was built for publication: Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors