Rong Pan is giving a practice talk for OOPSLA next week.
Rong will also be around all day if you want to meet him (feel free to change time slots).
------------------------------------------------------------------------------------------------------------
Who: Rong Pan (now UT-Austin, before ugrad at UW-Madison)
Where: CS3310Â
When: Friday 10/18 1230-130
Â
Title: Automatic Repair of Regular Expressions
Abstract:Â
We introduce RFixer, a tool for repairing complex regular expressions using examples. Given an incorrect regular _expression_ and sets of positive and negative examples, RFixer synthesizes the closest regular _expression_ to the original one that is consistent with the examples. Automatically repairing regular expressions requires exploring a large search space because practical regular expressions: i) are large, ii) operate over very large alphabetsâe.g., UTF-16 and ASCIIâand iii) employ complex constructsâe.g., character classes and numerical quantifiers. RFixerâs repair algorithm achieves scalability by taking advantage of structural properties of regular expressions to effectively prune the search space, and it employs satisfiability modulo theory solvers to efficiently and symbolically explore the sets of possible character classes and numerical quantifiers. RFixer could successfully compute minimal repairs for regular expressions collected from a variety of sources, whereas existing tools either failed to produce any repair or produced overly complex repairs.
![[Computer Systems Lab]](http://www.cs.wisc.edu/pics/csl_logo.gif){kind=logo}