Foundations of Boolean stream runtime verification

DOI10.1016/J.TCS.2016.04.019MaRDI QIDQ278752zbMATH OpenOpenAlexFDO

Authors Laura Bozzelli, César Sánchez

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

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

Recommendations

• Runtime Verification over Out-of-order Streams
• Declarative stream runtime verification (hLola)
• Checked corecursive streams: expressivity and completeness
• Streaming transducers for algorithmic verification of single-pass list-processing programs
• The ins and outs of first-order runtime verification
• Runtime verification logics. A language design perspective
• Verification of Boolean programs with unbounded thread creation
• Correctness of dataflow and systolic algorithms using algebras of streams

Cites work

• scientific article; zbMATH DE number 1670800 (Why is no real title available?)
• scientific article; zbMATH DE number 4013999 (Why is no real title available?)
• scientific article; zbMATH DE number 53101 (Why is no real title available?)
• scientific article; zbMATH DE number 2080059 (Why is no real title available?)
• scientific article; zbMATH DE number 1531624 (Why is no real title available?)
• scientific article; zbMATH DE number 2189137 (Why is no real title available?)
• A First-Order Policy Language for History-Based Transaction Monitoring
• A brief account of runtime verification
• Collecting statistics over runtime executions
• DReX: a declarative language for efficiently evaluating regular string transformations
• Extended symbolic finite automata and transducers
• On temporal logic and signal processing
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• Reasoning with temporal logic on truncated paths.
• Symbolic finite state transducers: algorithms and applications
• Synchronous Kahn networks
• Temporal logic can be more expressive
• Verification, Model Checking, and Abstract Interpretation

Cited in

(4)

• Declarative stream runtime verification (hLola)
• TeSSLa: temporal stream-based specification language
• Runtime Verification over Out-of-order Streams
• Introduction to the special issue on runtime verification

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q278752)