Twinning Automata and Regular Expressions for String Static Analysis
No abstract available.
Related papers
- Precise and scalable static analysis of jQuery using a regular expression domain DLS 2016
- Precise Analysis of String Expressions SAS 2003
- Enumerating the strings of regular languages JFP 2004
- Mata: A Fast and Simple Finite Automata Library TACAS 2024
- Symbolic Boolean derivatives for efficiently solving extended regular expression constraints PLDI 2021
- What is decidable about string constraints with the ReplaceAll function POPL 2018
- An SMT Solver for Regular Expressions and Linear Arithmetic over String Length CAV 2021
- Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions TACAS 2017