82 |
82 |
83 <TR> |
83 <TR> |
84 <TD BGCOLOR="#FFFFFF" WIDTH="75%"> |
84 <TD BGCOLOR="#FFFFFF" WIDTH="75%"> |
85 <H3>Pending</H3> |
85 <H3>Pending</H3> |
86 |
86 |
87 <p><B>A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions.</B> |
|
88 (with Wu and Zhang) Journal version. The first round of reviews has been positive. |
|
89 We are asked to make some modifications. |
|
90 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rexp.pdf">pdf</A>] |
|
91 |
|
92 <p><B>Priority Inheritance Protocol Proved Correct.</B> |
87 <p><B>Priority Inheritance Protocol Proved Correct.</B> |
93 (with Zhang and Wu) Journal version. Submitted. |
88 (with Zhang and Wu) Journal version. Submitted. |
94 [<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>] |
95 |
90 |
96 <p><B>How to Prove False using the Variable Convention.</B> |
91 <p><B>How to Prove False using the Variable Convention.</B> |
106 </TR> |
101 </TR> |
107 |
102 |
108 <TR> |
103 <TR> |
109 <TD BGCOLOR="FFFFFF" WIDTH="75%"> |
104 <TD BGCOLOR="FFFFFF" WIDTH="75%"> |
110 <H3>2013</H3> |
105 <H3>2013</H3> |
|
106 <p><B>A Formalisation of the Myhill-Nerode Theorem based on Regular Expressions.</B> |
|
107 (with Wu and Zhang) Accepted in the Journal of Automated Reasoning, 2013 |
|
108 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rexp.pdf">pdf</A>] |
|
109 |
111 <p><B>Mechanising Turing Machines and Computability Theory in Isabelle/HOL.</B> |
110 <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 |
111 (with Xu and Zhang) In Proceedings of the 4th Conference on Interactive |
113 Theorem Proving (ITP 2013). In Volume 7998 of Lecture Notes in |
112 Theorem Proving (ITP 2013). In Volume 7998 of Lecture Notes in |
114 Computer Science. Pages 147-162. |
113 Computer Science. Pages 147-162. |
115 © <A HREF="http://link.springer.com/chapter/10.1007/978-3-642-39634-2_13">Springer Verlag</A> |
114 © <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>]<BR><BR> |
115 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/tm.pdf">pdf</A>]<BR><BR> |
117 |
116 |
118 (The phrase in the abstract is meant to say "we tie the knot ... ". This typo |
117 (The phrase in the abstract is meant to say "we tie the knot ... ". This typo |
119 is corrected in the version above.) |
118 is corrected in the version above.) |
120 |
119 |
121 <p><B>A Formal Model and Correctness Proof for an Access Control Policy Framework.</B> |
120 <p><B>A Formal Model and Correctness Proof for an Access Control Policy Framework.</B> |
122 (with Wu and Zhang) In Proceedings of the 3rd Conference on Certified Programs |
121 (with Wu and Zhang) In Proceedings of the 3rd Conference on Certified Programs |
123 and Proofs (CPP 2013). In Lecture Notes in Computer Science. |
122 and Proofs (CPP 2013). In Lecture Notes in Computer Science. |
|
123 [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rc.pdf">pdf</A>] |
124 </TD> |
124 </TD> |
125 </TR> |
125 </TR> |
126 |
126 |
127 |
127 |
128 <TR> |
128 <TR> |