Symbolic Boolean derivatives for efficiently solving extended regular expression constraints.
Caleb StanfordMargus VeanesNikolaj BjørnerPublished in: PLDI (2021)
Keyphrases
- regular expressions
- pattern matching
- regular path queries
- semistructured databases
- finite domain
- finite automata
- string matching
- regular path expressions
- real valued
- semistructured data
- deterministic finite automata
- cost model
- constraint programming
- xml schema
- static analysis
- global constraints
- linear constraints
- databases
- boolean functions
- high level
- data mining