Semantic Foundations for Deterministic Dataflow and Stream Processing
From MaRDI portal
Publication:5041103
DOI10.1007/978-3-030-44914-8_15OpenAlexW3017159537MaRDI QIDQ5041103FDOQ5041103
Authors: Konstantinos Mamouras 
Publication date: 13 October 2022
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-44914-8_15
Recommendations
- Intensional and extensional semantics of dataflow programs
- Fixed point semantics for stream reasoning
- A fixpoint semantics for nondeterministic data flow
- scientific article; zbMATH DE number 554489
- Publication:4723281
- Semantics of multiway dataflow constraint systems
- An extensional fixed-point semantics for nondeterministic data flow
- Database Theory - ICDT 2005
- scientific article; zbMATH DE number 3978355
- Dataflow semantics for Petri nets
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)
Cites Work
- Title not available (Why is that?)
- The Esterel synchronous programming language: Design, semantics, implementation
- Zélus: a synchronous language with ODEs
- Elements of automata theory. Translated from the French by Reuben Thomas
- Universal coalgebra: A theory of systems
- Symbolic finite state transducers: algorithms and applications
- Title not available (Why is that?)
- A coinductive calculus of streams
- Traced monoidal categories
- On Relations Defined by Generalized Finite Automata
- A brief account of runtime verification
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Title not available (Why is that?)
- A completeness theorem for Kleene algebras and the algebra of regular events
- Generalising monads to arrows
- Title not available (Why is that?)
- Kleene algebra with equations
- The calculus of constructions
- Functional reactive animation
- An elementary proof of the completeness of PDL
- Sur une variante des fonctions séquentielles
- Database Theory - ICDT 2005
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- Title not available (Why is that?)
- Sequential Functions
- Synchronous programming with events and relations: The SIGNAL language and its semantics
- Safe functional reactive programming through dependent types
- Improving flow analyses via ΓCFA
- Programming Languages and Systems
- Title not available (Why is that?)
- A Characterization of Machine Mappings
- On the completeness of propositional Hoare logic
- Title not available (Why is that?)
- Robust online monitoring of signal temporal logic
- Derivatives of quantitative regular expressions
- Streamable regular transductions
- Automata-based stream processing
- Quantitative regular expressions for arrhythmia detection algorithms
- Synthesis of strategies using the Hoare logic of angelic and demonic nondeterminism
- Higher-order functional reactive programming without spacetime leaks
- Safe Data Parallelism for General Streaming
- The Hoare logic of deterministic and nondeterministic monadic recursion schemes
- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism
- On the Hoare theory of monadic recursion schemes
- Equational theories of abnormal termination based on Kleene algebra
Cited In (17)
- Title not available (Why is that?)
- Database Theory - ICDT 2005
- A universal calculus for stream processing languages
- The lax braided structure of streaming I/O
- Hyperstream processing systems, nonstandard modeling of continuous-time signals
- The Essence of Dataflow Programming
- Automata-based stream processing
- Semantics of multiway dataflow constraint systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extension of Type-Based Approach to Generation of Stream-Processing Programs by Automatic Insertion of Buffering Primitives
- Monoidal streams for dataflow programming
- Foundations of total functional data-flow programming
- Programming Languages and Systems
- Stability, sequentiality and demand driven evaluation in dataflow
- On bounded-memory stream data processing with description logics
- Programming by composing filters
Uses Software
This page was built for publication: Semantic Foundations for Deterministic Dataflow and Stream Processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041103)
