Semantic Foundations for Deterministic Dataflow and Stream Processing
From MaRDI portal
Publication:5041103
DOI10.1007/978-3-030-44914-8_15OpenAlexW3017159537MaRDI QIDQ5041103
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- The calculus of constructions
- An elementary proof of the completeness of PDL
- Synchronous programming with events and relations: The SIGNAL language and its semantics
- The Esterel synchronous programming language: Design, semantics, implementation
- Sur une variante des fonctions séquentielles
- A completeness theorem for Kleene algebras and the algebra of regular events
- Generalising monads to arrows
- Universal coalgebra: A theory of systems
- On the completeness of propositional Hoare logic
- Streamable regular transductions
- A brief account of runtime verification
- Robust online monitoring of signal temporal logic
- Safe functional reactive programming through dependent types
- Symbolic finite state transducers
- Synthesis of Strategies and the Hoare Logic of Angelic Nondeterminism
- Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism
- Safe Data Parallelism for General Streaming
- Zélus
- Equational Theories of Abnormal Termination Based on Kleene Algebra
- Sequential Functions
- On the Hoare theory of monadic recursion schemes
- A coinductive calculus of streams
- Traced monoidal categories
- Automata-Based Stream Processing
- Kleene Algebra with Equations
- Derivatives of Quantitative Regular Expressions
- Quantitative Regular Expressions for Arrhythmia Detection Algorithms
- Higher-order functional reactive programming without spacetime leaks
- The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes
- Database Theory - ICDT 2005
- Functional reactive animation
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- Improving flow analyses via ΓCFA
- On Relations Defined by Generalized Finite Automata
- A Characterization of Machine Mappings
- Properties of a Model for Parallel Computations: Determinacy, Termination, Queueing
- Programming Languages and Systems
This page was built for publication: Semantic Foundations for Deterministic Dataflow and Stream Processing
