Foundations of Boolean stream runtime verification

DOI10.1016/j.tcs.2016.04.019zbMath1339.68165OpenAlexW2336727880MaRDI QIDQ278752

César Sánchez, Laura Bozzelli

Publication date: 2 May 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.019

zbMATH Keywords

complexityexpressivenessefficiency in closure operationsoffline monitoringsuccinctness

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Introduction to the special issue on runtime verification

Uses Software

• FoCs
• SIGNAL
• LUSTRE
• DReX
• Esterel
• Copilot
• MonPoly
• LOLA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extended symbolic finite automata and transducers
• Collecting statistics over runtime executions
• A brief account of runtime verification
• Synchronous Kahn networks
• DReX
• Symbolic finite state transducers
• Temporal logic can be more expressive
• A First-Order Policy Language for History-Based Transaction Monitoring
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• On Temporal Logic and Signal Processing
• Computer Aided Verification
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Foundations of Boolean stream runtime verification