publications.html
changeset 214 90f4682c4343
parent 213 b7bf46c8e3d9
child 215 2e80c480ec7e
equal deleted inserted replaced
213:b7bf46c8e3d9 214:90f4682c4343
   111 <p><B>Mechanising Turing Machines and Computability Theory in Isabelle/HOL.</B> 
   111 <p><B>Mechanising Turing Machines and Computability Theory in Isabelle/HOL.</B> 
   112       (with Xu and Zhang) In Proceedings of the 4th Conference on Interactive
   112       (with Xu and Zhang) In Proceedings of the 4th Conference on Interactive
   113       Theorem Proving (ITP 2013). In Volume 7998 of Lecture Notes in 
   113       Theorem Proving (ITP 2013). In Volume 7998 of Lecture Notes in 
   114       Computer Science. Pages 147-162.
   114       Computer Science. Pages 147-162.
   115       &copy <A HREF="http://link.springer.com/chapter/10.1007/978-3-642-39634-2_13">Springer Verlag</A>
   115       &copy <A HREF="http://link.springer.com/chapter/10.1007/978-3-642-39634-2_13">Springer Verlag</A>
   116       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tm.pdf">pdf</A>]
   116       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tm.pdf">pdf</A>]<BR><BR>
   117 
   117 
   118       (The phrase in the abstract is meant to say &quot; we tie the knot ... &quot;. This typo
   118       (The phrase in the abstract is meant to say &quot; we tie the knot ... &quot;. This typo
   119       is corrected in the version above.)
   119       is corrected in the version above.)
   120   
   120   
   121   <p><B>A Formal Model and Correctness Proof for an Access Control Policy Framework.</B> 
   121   <p><B>A Formal Model and Correctness Proof for an Access Control Policy Framework.</B> 
   129 <TD BGCOLOR="FFFFFF" WIDTH="75%">
   129 <TD BGCOLOR="FFFFFF" WIDTH="75%">
   130 <H3>2012</H3>
   130 <H3>2012</H3>
   131 <p><B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B> 
   131 <p><B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B> 
   132       (with Kaliszyk) Journal of Logical
   132       (with Kaliszyk) Journal of Logical
   133       Methods in Computer Science, Volume 8 (2:14), 2012. 35 pages. 
   133       Methods in Computer Science, Volume 8 (2:14), 2012. 35 pages. 
   134       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lmcs.pdf">pdf</A>]<BR><BR>
   134       [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lmcs.pdf">pdf</A>]
   135 
   135 
   136 <p><b>Priority Inheritance Protocol Proved Correct.</B> 
   136 <p><b>Priority Inheritance Protocol Proved Correct.</B> 
   137       (with Zhang and Wu) In Proceedings of the 3rd Conference on Interactive
   137       (with Zhang and Wu) In Proceedings of the 3rd Conference on Interactive
   138       Theorem Proving (ITP 2012). In Volume 7406 of Lecture Notes in 
   138       Theorem Proving (ITP 2012). In Volume 7406 of Lecture Notes in 
   139       Computer Science. Pages 217-232.
   139       Computer Science. Pages 217-232.
   493 </TR>
   493 </TR>
   494 
   494 
   495 
   495 
   496 </TABLE>
   496 </TABLE>
   497 <P>
   497 <P>
   498 <!-- hhmts start --> Last modified: Tue Sep  3 14:01:29 BST 2013 <!-- hhmts end -->
   498 <!-- hhmts start --> Last modified: Tue Sep  3 14:03:54 BST 2013 <!-- hhmts end -->
   499 <a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
   499 <a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
   500  
   500  
   501 </BODY>
   501 </BODY>
   502 </HTML>
   502 </HTML>