POSIX lexing with derivatives of regular expressions

DOI10.1007/s10817-023-09667-1OpenAlexW2572917468MaRDI QIDQ6111525

Christian Urban

Publication date: 4 August 2023

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-023-09667-1

zbMATH Keywords

derivatives of regular expressionsPOSIX matching

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• Adapting functional programs to higher order logic
• Proof Pearl: regular expression equivalence and relation algebra
• POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
• Optimally Streaming Greedy Regular Expression Parsing
• Regular expression types for XML
• Bit-coded Regular Expression Parsing
• Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions
• A Decision Procedure for Regular Expression Equivalence in Type Theory
• POSIX Regular Expression Parsing with Derivatives
• Automata, Languages and Programming
• Derivatives of Regular Expressions