GPCE 2018
Mon 5 - Tue 6 November 2018 Boston, Massachusetts, United States
co-located with SPLASH 2018
Tue 6 Nov 2018 16:00 - 16:30 at Studio 2 - VI Chair(s): Stefan Marr

Regular expressions are part of every programmer’s toolbox. They are used for a wide variety of language-related tasks and there are many algorithms for manipulating them. In particular, matching algorithms that detect whether a word belongs to the language described by a regular expression are well explored, yet new algorithms appear frequently. However, there is no satisfactory methodology for testing such matchers.

We propose a testing methodology which is based on generating positive as well as negative examples of words in the language. To this end, we present a new algorithm to generate the language described by a generalized regular expression with intersection and complement operators. The complement operator allows us to generate both positive and negative example words from a given regular expression. We implement our generator in Haskell and OCaml and show that its performance is more than adequate for testing.

Tue 6 Nov
Times are displayed in time zone: (GMT-05:00) Guadalajara, Mexico City, Monterrey change

15:30 - 17:00: GPCE 2018 - VI at Studio 2
Chair(s): Stefan MarrUniversity of Kent
gpce-201815:30 - 16:00
Michael NiekeTU Braunschweig, Germany, Jacopo MauroUniversity of Southern Denmark, Christoph SeidlTechnische Universität Braunschweig, Thomas ThümTU Braunschweig, Germany, Ingrid Chieh YuUniversity of Oslo, Felix FranzkeTU Braunschweig
gpce-201816:00 - 16:30
Gabriel RadanneUniversity of Freiburg, Peter ThiemannUniversity of Freiburg
DOI Pre-print
gpce-201816:30 - 17:00
Yin LiuVirginia Tech, Kijin AnVirginia Tech, Eli TilevichVirginia Tech