DReX

DOI10.1145/2676726.2676981zbMath1345.68032OpenAlexW2113382057MaRDI QIDQ2819796

Mukund Raghothaman, Loris D'Antoni, Rajeev Alur

Publication date: 29 September 2016

Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2676726.2676981

zbMATH Keywords

declarative languagesstring transformationsDReX

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (7)

Foundations of Boolean stream runtime verification ⋮ A symbolic decision procedure for symbolic alternating finite automata ⋮ Forward Bisimulations for Nondeterministic Symbolic Finite Automata ⋮ Streamable regular transductions ⋮ Regular Programming for Quantitative Properties of Data Streams ⋮ DReX ⋮ Regular transducer expressions for regular transformations

This page was built for publication: DReX