publications.html
changeset 401 3f6d96fa5901
parent 367 27e64f2a5369
child 404 f51aebc23fbf
equal deleted inserted replaced
400:cf44e95e28f2 401:3f6d96fa5901
    86 
    86 
    87 <p><B>Priority Inheritance Protocol Proved Correct.</B> 
    87 <p><B>Priority Inheritance Protocol Proved Correct.</B> 
    88       (with Zhang and Wu) Journal version. Submitted.
    88       (with Zhang and Wu) Journal version. Submitted.
    89       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/pip.pdf">pdf</A>]
    89       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/pip.pdf">pdf</A>]
    90 
    90 
    91 <p><B>How to Prove False using the Variable Convention.</B> 
    91 <p><B>POSIX Lexing with Derivatives of Regular Expressions</B>
    92      Appears as a poster at TTVSI, 1 page. 
    92       (with Ausaf and Dyckhoff) Submitted.
    93      [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/mike-poster-abstract-08.pdf">pdf</A>]
       
    94      [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/mike-poster-08.pdf">poster</A>]
       
    95 
       
    96 <p><B>Strong Induction Principles in the Locally Nameless 
       
    97       Representation of Binders (Preliminary Notes).</B> (with Pollack) A shorter version 
       
    98       of this paper was accepted at WMM'07. 
       
    99       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/ln.pdf">pdf</A>]
       
   100 </TD>
    93 </TD>
   101 </TR>
    94 </TR>
   102 
    95 
   103 <TR>
    96 <TR>
   104 <TD BGCOLOR="FFFFFF" WIDTH="75%">
    97 <TD BGCOLOR="FFFFFF" WIDTH="75%">
   280       &copy <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-70590-1_28">Springer Verlag</A>
   273       &copy <A HREF="http://link.springer.com/chapter/10.1007%2F978-3-540-70590-1_28">Springer Verlag</A>
   281       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rta-08.pdf">pdf</A>]<BR><BR>
   274       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rta-08.pdf">pdf</A>]<BR><BR>
   282 
   275 
   283       (This paper corrects some lemmas in my PhD-thesis. The errors were found by formalising
   276       (This paper corrects some lemmas in my PhD-thesis. The errors were found by formalising
   284        the proof in Nominal Isabelle.)		  
   277        the proof in Nominal Isabelle.)		  
       
   278 
       
   279 <p><B>How to Prove False using the Variable Convention.</B> 
       
   280      Appeared as a poster at TTVSI (Mike fest), 1 page. 
       
   281      [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/mike-poster-abstract-08.pdf">pdf</A>]
       
   282      [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/mike-poster-08.pdf">poster</A>]
   285 </TD>
   283 </TD>
   286 </TR>
   284 </TR>
   287 
   285 
   288 <TR>
   286 <TR>
   289 <TD BGCOLOR="FFFFFF" WIDTH="75%">
   287 <TD BGCOLOR="FFFFFF" WIDTH="75%">
   301 <p><B>Nominal Techniques in Isabelle/HOL.</B> In
   299 <p><B>Nominal Techniques in Isabelle/HOL.</B> In
   302       Journal of Automatic Reasoning, 2008, Vol. 40(4), 327-356.
   300       Journal of Automatic Reasoning, 2008, Vol. 40(4), 327-356.
   303       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-tech.ps">ps</A>]  
   301       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-tech.ps">ps</A>]  
   304       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-tech.pdf">pdf</A>]
   302       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-tech.pdf">pdf</A>]
   305 
   303 
       
   304 <p><B>Strong Induction Principles in the Locally Nameless 
       
   305       Representation of Binders (Preliminary Notes).</B> (with Pollack) A shorter version 
       
   306       of this paper was accepted at WMM'07. 
       
   307       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/ln.pdf">pdf</A>]
       
   308   
   306 <p><B>Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking.</B> 
   309 <p><B>Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking.</B> 
   307       (with Narboux) In Proceedings of the International Workshop on Logical Frameworks and 
   310       (with Narboux) In Proceedings of the International Workshop on Logical Frameworks and 
   308       Meta-Languages: Theory and Practice (LFMTP 2007). Electronic Notes in
   311       Meta-Languages: Theory and Practice (LFMTP 2007). Electronic Notes in
   309       Theoretical Computer Science. Vol. 196. Pages 3-18.
   312       Theoretical Computer Science. Vol. 196. Pages 3-18.
   310       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lfmtp-07.pdf">pdf</A>]<BR><BR>
   313       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lfmtp-07.pdf">pdf</A>]<BR><BR>
   504 </TR>
   507 </TR>
   505 
   508 
   506 
   509 
   507 </TABLE>
   510 </TABLE>
   508 <P>
   511 <P>
   509 <!-- hhmts start --> Last modified: Fri Jun 12 21:56:33 BST 2015 <!-- hhmts end -->
   512 <!-- hhmts start --> Last modified: Fri Mar 25 11:45:40 GMT 2016 <!-- hhmts end -->
   510 <a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
   513 <a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
   511  
   514  
   512 </BODY>
   515 </BODY>
   513 </HTML>
   516 </HTML>