POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
DOI10.1007/978-3-319-43144-4_5zbMATH Open1478.68118OpenAlexW2481729626MaRDI QIDQ2829247FDOQ2829247
Christian Urban, Roy Dyckhoff, Fahad Ausaf
Publication date: 27 October 2016
Published in: Interactive Theorem Proving (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10023/9472
Recommendations
- POSIX lexing with derivatives of regular expressions
- POSIX regular expression parsing with derivatives
- Regular-expression derivatives re-examined
- Formalising Boost POSIX regular expression matching
- Formalising and implementing Boost POSIX regular expression matching
- Derivatives of regular expressions and an application
- Partial derivatives of an extended regular expression
- Manipulation of regular expressions using derivatives: an overview
- Two-sided derivatives for regular expressions and for hairpin expressions
- Two-sided derivatives for regular expressions and for hairpin expressions
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Formalization of mathematics in connection with theorem provers (68V20) Algorithms on strings (68W32)
Cites Work
- POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
- Derivatives of Regular Expressions
- Proof Pearl: regular expression equivalence and relation algebra
- Automata, Languages and Programming
- A Decision Procedure for Regular Expression Equivalence in Type Theory
- Adapting functional programs to higher order logic
- POSIX Regular Expression Parsing with Derivatives
Cited In (3)
Uses Software
This page was built for publication: POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829247)
