Semantic Foundations for Deterministic Dataflow and Stream Processing
From MaRDI portal
Publication:5041103
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
Cites work
- scientific article; zbMATH DE number 3970103 (Why is no real title available?)
- scientific article; zbMATH DE number 3469994 (Why is no real title available?)
- scientific article; zbMATH DE number 3493844 (Why is no real title available?)
- scientific article; zbMATH DE number 3566181 (Why is no real title available?)
- scientific article; zbMATH DE number 1304993 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 2087568 (Why is no real title available?)
- A Characterization of Machine Mappings
- A brief account of runtime verification
- A coinductive calculus of streams
- A completeness theorem for Kleene algebras and the algebra of regular events
- An elementary proof of the completeness of PDL
- Automata-based stream processing
- Database Theory - ICDT 2005
- Derivatives of quantitative regular expressions
- Elements of automata theory. Translated from the French by Reuben Thomas
- Equational theories of abnormal termination based on Kleene algebra
- Functional reactive animation
- Generalising monads to arrows
- Higher-order functional reactive programming without spacetime leaks
- Improving flow analyses via ΓCFA
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Kleene algebra with equations
- On Relations Defined by Generalized Finite Automata
- On the Hoare theory of monadic recursion schemes
- On the completeness of propositional Hoare logic
- Programming Languages and Systems
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- Quantitative regular expressions for arrhythmia detection algorithms
- Robust online monitoring of signal temporal logic
- Safe Data Parallelism for General Streaming
- Safe functional reactive programming through dependent types
- Sequential Functions
- Streamable regular transductions
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- Sur une variante des fonctions séquentielles
- Symbolic finite state transducers: algorithms and applications
- Synchronous programming with events and relations: The SIGNAL language and its semantics
- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism
- Synthesis of strategies using the Hoare logic of angelic and demonic nondeterminism
- The Esterel synchronous programming language: Design, semantics, implementation
- The Hoare logic of deterministic and nondeterministic monadic recursion schemes
- The calculus of constructions
- Traced monoidal categories
- Universal coalgebra: A theory of systems
- Zélus: a synchronous language with ODEs
Cited in
(17)- scientific article; zbMATH DE number 5666832 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 17812 (Why is no real title available?)
- scientific article; zbMATH DE number 4084982 (Why is no real title available?)
- 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
Describes a project that uses
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)
