2013 IEEE Sixth International Conference on Software Testing, Verification and Validation (2010)
Apr. 6, 2010 to Apr. 9, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICST.2010.15
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.
regular expressions, finite automata, satisfiability modulo theories, strings
Margus Veanes, Nikolai Tillmann, Peli de Halleux, "Rex: Symbolic Regular Expression Explorer", 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation, vol. 00, no. , pp. 498-507, 2010, doi:10.1109/ICST.2010.15