Séminaire Cambium, Inria Paris
                                     BJ09
                           Vendredi 20 mars, 10h30

                               Aurèle Barrière
                                     CNRS

   Linear and Formally Verified Matching of JavaScript Regular Expressions

Modern regex languages have diverged significantly from traditional regular expressions.
Modern regex implementations at times suffer from complexity vulnerabilities and semantic bugs.
We introduce new linear time matching algorithms to support JavaScript-specific semantics.
We then present a full translation of the ECMAScript regex chapter in the proof assistant Rocq.
We conclude with our on-going effort towards a formally verified, linear-time, expressive JavaScript
regular expression engine.

            Vous pouvez vous abonner à nos annonces de séminaires:
                     http://cambium.inria.fr/seminar.html

             Nos séminaires sont accessibles en ligne en direct
                            via le lien ci-dessus.