The Community for Technology Leaders
RSS Icon
Subscribe
Paris, France
Apr. 6, 2010 to Apr. 9, 2010
ISBN: 978-0-7695-3990-4
pp: 498-507
ABSTRACT
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.
INDEX TERMS
regular expressions, finite automata, satisfiability modulo theories, strings
CITATION
Margus Veanes, Peli de Halleux, Nikolai Tillmann, "Rex: Symbolic Regular Expression Explorer", ICST, 2010, 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation, 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation 2010, pp. 498-507, doi:10.1109/ICST.2010.15
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool