Runtime Verification Based on Register Automata

DOI10.1007/978-3-642-36742-7_19zbMath1381.68165arXiv1209.5325OpenAlexW1795569145MaRDI QIDQ5326330

Nikos Tzevelekos, Rasmus L. Petersen, Dino Distefano, Radu Grigore

Publication date: 5 August 2013

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.5325

Mathematics Subject Classification ID

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

Related Items (8)

Reachability in pushdown register automata ⋮ On-the-fly bisimilarity checking for fresh-register automata ⋮ Unnamed Item ⋮ Polynomial-time equivalence testing for deterministic fresh-register automata ⋮ Regular and context-free nominal traces ⋮ Unnamed Item ⋮ A theory of monitors ⋮ Coalgebraic semantics for nominal automata

Uses Software

• ConSpec
• SLAM
• AspectJ

This page was built for publication: Runtime Verification Based on Register Automata