SPLASH 2020
Sun 15 - Sat 21 November 2020 Online Conference
Tue 17 Nov 2020 16:00 - 16:20 at SPLASH-I - T-5 Chair(s): Raffi Khatchadourian, Tyler Sorensen
Wed 18 Nov 2020 04:00 - 04:20 at SPLASH-I - T-5 Chair(s): Burcu Kulahcioglu Ozkan, Reuben Rowe

We propose a solution to the problem of efficient matching regular expressions (regexes) with bounded repetition, such as $\texttt{(ab){1,100}}$, using deterministic automata. For this, we introduce novel \emph{counting-set automata (CsAs)}, automata with registers that can hold sets of bounded integers and can be manipulated by a limited portfolio of constant-time operations. We present an algorithm that compiles a large sub-class of regexes to deterministic CsAs. This includes (1) a novel Antimirov-style translation of regexes with counting to \emph{counting automata (CAs)}, nondeterministic automata with bounded counters, and (2) our main technical contribution, a determinization of CAs that outputs CsAs. The main advantage of this workflow is that \emph{the size of the produced CsAs does not depend on the repetition bounds used in the regex} (while the size of the DFA is exponential to them). Our experimental results confirm that deterministic CsAs produced from practical regexes with repetition are indeed vastly smaller than the corresponding DFAs. More importantly, our prototype matcher based on CsA simulation handles practical regexes with repetition regardless of sizes of counter bounds. It easily copes with regexes with repetition where state-of-the-art matchers struggle.

Tue 17 Nov
Times are displayed in time zone: Central Time (US & Canada) change

15:00 - 16:20: T-5OOPSLA at SPLASH-I +12h
Chair(s): Raffi KhatchadourianCity University of New York, Tyler SorensenUniversity of California at Santa Cruz
15:00 - 15:20
Talk
OOPSLA
Mehdi BagherzadehOakland University, Nicholas FiremanOakland University, Anas ShaweshOakland University, Raffi KhatchadourianCity University of New York
Link to publication DOI Pre-print Media Attached
15:20 - 15:40
Talk
OOPSLA
Arjen RouvoetDelft University of Technology, Hendrik van AntwerpenDelft University of Technology, Casper Bach PoulsenDelft University of Technology, Robbert KrebbersRadboud University Nijmegen, Eelco VisserDelft University of Technology
Link to publication DOI Pre-print Media Attached
15:40 - 16:00
Talk
OOPSLA
Quentin StiévenartVrije Universiteit Brussel, Magnus MadsenAarhus University
Link to publication DOI Media Attached
16:00 - 16:20
Talk
OOPSLA
Lenka TuroňováBrno University of Technology, Lukáš HolíkBrno University of Technology, Ondřej LengálBrno University of Technology, Olli SaarikiviMicrosoft, Margus VeanesMicrosoft, Tomáš VojnarBrno University of Technology
Link to publication DOI Media Attached

Wed 18 Nov
Times are displayed in time zone: Central Time (US & Canada) change

03:00 - 04:20: T-5OOPSLA at SPLASH-I
Chair(s): Burcu Kulahcioglu OzkanMPI-SWS, Reuben RoweUniversity College London
03:00 - 03:20
Talk
OOPSLA
Mehdi BagherzadehOakland University, Nicholas FiremanOakland University, Anas ShaweshOakland University, Raffi KhatchadourianCity University of New York
Link to publication DOI Pre-print Media Attached
03:20 - 03:40
Talk
OOPSLA
Arjen RouvoetDelft University of Technology, Hendrik van AntwerpenDelft University of Technology, Casper Bach PoulsenDelft University of Technology, Robbert KrebbersRadboud University Nijmegen, Eelco VisserDelft University of Technology
Link to publication DOI Pre-print Media Attached
03:40 - 04:00
Talk
OOPSLA
Quentin StiévenartVrije Universiteit Brussel, Magnus MadsenAarhus University
Link to publication DOI Media Attached
04:00 - 04:20
Talk
OOPSLA
Lenka TuroňováBrno University of Technology, Lukáš HolíkBrno University of Technology, Ondřej LengálBrno University of Technology, Olli SaarikiviMicrosoft, Margus VeanesMicrosoft, Tomáš VojnarBrno University of Technology
Link to publication DOI Media Attached