Regular Programming for Quantitative Properties of Data Streams
From MaRDI portal
Publication:2802466
DOI10.1007/978-3-662-49498-1_2zbMath1335.68041OpenAlexW2399084089MaRDI QIDQ2802466
Mukund Raghothaman, Dana Fisman, Rajeev Alur
Publication date: 26 April 2016
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49498-1_2
Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
From LTL to rLTL monitoring: improved monitorability through robust semantics ⋮ Deriving generic bounds for time-series constraints based on regular expressions characteristics ⋮ Streamable regular transductions ⋮ A formally verified, optimized monitor for metric first-order dynamic logic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Handbook of weighted automata
- On notions of regularity for data languages
- Macro tree transducers
- Selection and sorting with limited storage
- Monadic second-order definable graph transductions: a survey
- Finite-memory automata
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- DReX
- Symbolic finite state transducers
- Quantitative languages
- Streaming Tree Transducers
- Two-variable logic on data trees and XML reasoning
- Data Streams: Algorithms and Applications
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- Regular combinators for string transformations
- Regular Functions and Cost Register Automata
- Minimization of symbolic automata
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- Ambiguity in Graphs and Expressions
- An Effective Algorithm for the Membership Problem for Extended Regular Expressions
This page was built for publication: Regular Programming for Quantitative Properties of Data Streams
