King's College London

Research portal

POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)

Research output: Chapter in Book/Report/Conference proceedingConference paper

Fahad Ausaf, Roy Dyckhoff, Christian Urban

Original languageEnglish
Title of host publicationInteractive Theorem Proving
Subtitle of host publication7th International Conference, ITP 2016, Nancy, France, August 22-25, 2016, Proceedings
Place of PublicationSpringer LNCS
PublisherSpringer International Publishing
Pages69-86
Number of pages17
ISBN (Electronic)978-3-319-43144-4
ISBN (Print)978-3-319-43143-7
DOIs
Publication statusPublished - 7 Aug 2016

Publication series

NameLecture Notes in Computer Science
PublisherSpringer International Publishing
Volume9807
ISSN (Electronic)0302-9743

Documents

King's Authors

Abstract

Brzozowski introduced the notion of derivatives for regular expressions. They can be used for a very simple regular expression matching algorithm. Sulzmann and Lu cleverly extended this algorithm in order to deal with POSIX matching, which is the underlying disambiguation strategy for regular expressions needed in lexers. Sulzmann and Lu have made available on-line what they call a “rigorous proof” of the correctness of their algorithm w.r.t. their specification; regrettably, it appears to us to have unfillable gaps. In the first part of this paper we give our inductive definition of what a POSIX value is and show (i) that such a value is unique (for given regular expression and string being matched) and (ii) that Sulzmann and Lu’s algorithm always generates such a value (provided that the regular expression matches the string). We also prove the correctness of an optimised version of the POSIX matching algorithm. Our definitions and proof are much simpler than those by Sulzmann and Lu and can be easily formalised in Isabelle/HOL. In the second part we analyse the correctness argument by Sulzmann and Lu and explain why the gaps in this argument cannot be filled easily.

Download statistics

No data available

View graph of relations

© 2018 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454