Rex: symbolic regular expression explorer. Constraints in form regular expressions over strings are ubiquitous. They occur often in programming languages like Perl and C#, in SQL in form of LIKE expressions, and in web applications. Providing support for regular expression constraints in program analysis and testing has several useful applications. We introduce a method and a tool called Rex, for symbolically expressing and analyzing regular expression constraints. Rex is implemented using the SMT solver Z3, and we provide experimental evaluation of Rex.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Jialun Cao, Meiziniu Li, Yeting Li, Ming Wen, Shing-Chi Cheung: SemMT: A Semantic-based Testing Approach for Machine Translation Systems (2020) arXiv
- Veanes, Margus; Bjørner, Nikolaj: Symbolic tree automata (2015)
- Cimatti, Alessandro; Mover, Sergio; Roveri, Marco; Tonetta, Stefano: From sequential extended regular expressions to NFA with symbolic labels (2011)
- Hooimeijer, Pieter; Veanes, Margus: An evaluation of automata algorithms for string analysis (2011)