lex/index.html
changeset 392 880e62843614
child 393 c08b9d616f9d
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/lex/index.html	Fri Mar 11 12:48:03 2016 +0000
@@ -0,0 +1,68 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN" 
+"http://www.w3.org/TR/REC-html40/loose.dtd"> 
+<HEAD>
+<TITLE>HGMP</TITLE>
+<BASE HREF="http://www.inf.kcl.ac.uk/staff/urbanc/">
+</HEAD>
+
+<BODY TEXT="#000000" 
+      BGCOLOR="#4169E1" 
+      LINK="#0000EF" 
+      VLINK="#51188E" 
+      ALINK="#FF0000">
+
+<TABLE WIDTH="100%" 
+       BGCOLOR="#4169E1" 
+       BORDER="0"   
+       FRAME="border"  
+       CELLPADDING="10"     
+       CELLSPACING="2"
+       RULES="all">
+
+<!-- right column -->
+<TR>
+<TD BGCOLOR="#FFFFFF" WIDTH="75%">
+<H2>POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)</H2>
+ 
+Fahad Ausaf, Roy Dyckhoff, Christian Urban
+<p>
+
+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 it seems hard to turn it into a proof rigorous enough to
+be accepted by a system such as Isabelle/HOL.
+
+<H3>Theory Files for Isabelle 2016</H3>
+  
+<ul>
+<li> <A HREF="http://talisker.inf.kcl.ac.uk/%7Eurbanc/cgi-bin/repos.cgi/lexing/raw-file/tip/thys/ReStar.thy">ReStar.thy</A>
+</u>
+
+
+<H3>Links</A>
+
+<ul>
+<li> <A HREF="http://talisker.inf.kcl.ac.uk/%7Eurbanc/cgi-bin/repos.cgi/lexing/raw-file/tip/Literature/sulzmann14-new.pdf">the paper</A> by Sulzmann and Lu
+</ul>
+  
+</TABLE>
+<P>
+<!-- hhmts start --> Last modified: Fri Mar 11 12:20:03 GMT 2016 <!-- hhmts end -->
+<a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
+</BODY>
+</HTML>