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

Displayed time zone: Guadalajara, Mexico City, Monterrey change

15:30 - 17:00
VIGPCE 2018 at Studio 2
Chair(s): Stefan Marr University of Kent
15:30
30m
Talk
Anomaly Analyses for Feature-Model Evolution
GPCE 2018
Michael Nieke TU Braunschweig, Germany, Jacopo Mauro University of Southern Denmark, Christoph Seidl Technische Universität Braunschweig, Thomas Thüm University of Ulm, Ingrid Chieh Yu University of Oslo, Felix Franzke TU Braunschweig
16:00
30m
Talk
Regenerate: A Language Generator for Extended Regular Expressions
GPCE 2018
Gabriel Radanne University of Freiburg, Peter Thiemann University of Freiburg
DOI Pre-print
16:30
30m
Talk
RT-Trust: Automated Refactoring for Trusted Execution Under Real-Time Constraints
GPCE 2018
Yin Liu Virginia Tech, Kijin An Virginia Tech, Eli Tilevich Virginia Tech