DReX: a declarative language for efficiently evaluating regular string transformations

DOI10.1145/2676726.2676981MaRDI QIDQ2819796zbMATH OpenOpenAlexWikidataFDO

Authors Loris D'Antoni, Mukund Raghothaman, 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

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

Recommendations

• Regular combinators for string transformations
• Symbolic string transformations with regular lookahead and rollback
• Proof-directed program transformation: a functional account of efficient regular expression matching
• Modular descriptions of regular functions
• Translating regular expression matching into transducers

Cited in

(9)

• Symbolic string transformations with regular lookahead and rollback
• Foundations of Boolean stream runtime verification
• Regular Programming for Quantitative Properties of Data Streams
• Forward bisimulations for nondeterministic symbolic finite automata
• A symbolic decision procedure for symbolic alternating finite automata
• DReX
• scientific article; zbMATH DE number 1860714 (Why is no real title available?)
• Streamable regular transductions
• Efficient construction of reversible transducers from regular transducer expressions

This page was built for publication: DReX: a declarative language for efficiently evaluating regular string transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819796)