Fri 19 Jul 2019 10:30 - 11:00 at Reims - DS Session 2 Chair(s): Lisa Nguyen Quang Do

Brzozowski introduced in 1964 a beautifully simple algorithm for regular expression matching based on the notion of derivatives of regular expressions. In 2014, Sulzmann and Lu extended this algorithm to not just give an answer whether or not a regular expression matches a string, but in case it matches also how it matches the string. This is important for applications such as lexing (tokenising a string). The problem is to make the algorithm by Sulzmann and Lu fast on all input without breaking its correctness.

Fri 19 Jul

Displayed time zone: Belfast change

10:30 - 12:10
DS Session 2Doctoral Symposium at Reims
Chair(s): Lisa Nguyen Quang Do Paderborn University
Doctoral symposium paper
POSIX Regular Expression Matching and Lexing
Doctoral Symposium
Chengsong Tan King's College London
Doctoral symposium paper
Pointer Analysis as reachability problem over Push Down System
Doctoral Symposium
Jyoti Prakash University of Potsdam, Germany
Keynote: Self-Marketing as a Researcher
Doctoral Symposium
Ben Hermann Paderborn University
Media Attached