Efficient parametric runtime verification with deterministic string rewriting

Keyphrases

• Computable 100%
• Runtime Verification 100%
• Safety Properties 100%
• Finite State 100%
• String Rewriting 100%
• Turing Complete 100%
• Pattern Matching 50%
• Expressiveness 50%
• Formal Specification 50%
• Synthesis Algorithm 50%
• Context-free 50%
• Regular Logic 50%
• Temporal Logic Specification 50%
• Monitor Synthesis 50%
• Context-free Grammar 50%
• String Rewriting Systems 50%
• Aho-Corasick 50%
• Complete Monitoring 50%
• String Search 50%
• State Language 50%

Computer Science

• runtime verification 100%
• Modified Version 50%
• Temporal Logic 50%
• Formal Specification 50%
• Pattern Matching 50%
• Synthesis Algorithm 50%
• Context-Free Grammars 50%