On Symbolic Derivatives and Transition Regexes

11 pages•Published: May 26, 2024

Abstract

Symbolic derivatives of extended regular expressions or regexes provide a mechanism for incremental unfolding of regexes into symbolic automata. The underlying representation is in form of so called transition regexes, that are particularly useful in the context of SMT for supporting lazy propagation of Boolean operations such as complement. Here we introduce symbolic derivatives of further operations on regexes, including fusion and lookaheads, that are currently not supported in the context of SMT but have been used in many application domains ranging from matching to temporal logic specifications. We argue that those operators could also be supported in the context of SMT and motivate why such direct support would be beneficial.

Keyphrases: fusion, lookahead, smt, symbolic automaton, temporal logic

In: Nikolaj Bjørner, Marijn Heule and Andrei Voronkov (editors). LPAR 2024 Complementary Volume, vol 18, pages 152-162.

Links:	https://easychair.org/publications/paper/cgnn
	https://doi.org/10.29007/fgz5

BibTeX entry

@inproceedings{LPAR2024C:Symbolic_Derivatives_Transition_Regexes,
  author    = {Margus Veanes},
  title     = {On Symbolic Derivatives and Transition Regexes},
  booktitle = {LPAR 2024 Complementary Volume},
  editor    = {Nikolaj Bjørner and Marijn Heule and Andrei Voronkov},
  series    = {Kalpa Publications in Computing},
  volume    = {18},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/cgnn},
  doi       = {10.29007/fgz5},
  pages     = {152-162},
  year      = {2024}}

Download PDF Open PDF in browser