--- a/mc.html Sun Jul 06 22:56:29 2014 +0100
+++ b/mc.html Sun Jul 06 23:11:59 2014 +0100
@@ -1,8 +1,8 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"
"http://www.w3.org/TR/REC-html40/loose.dtd">
<HEAD>
-<TITLE>Priority Inversion Protocol</TITLE>
-<BASE HREF="http://www.dcs.kcl.ac.uk/staff/urbanc/">
+<TITLE>HGMP</TITLE>
+<BASE HREF="http://www.inf.kcl.ac.uk/staff/urbanc/">
</HEAD>
<BODY TEXT="#000000"
@@ -22,31 +22,15 @@
<!-- right column -->
<TR>
<TD BGCOLOR="#FFFFFF" WIDTH="75%">
-<H2>Proving the Priority Inheritance Protocol Correct</H2>
+<H2>Modelling homogeneous generative meta-programming: Artefact</H2>
-By Xingyuan Zhang, Christian Urban and Chunhan Wu
+Martin Berger, Laurence Tratt, Christian Urban
<p>
-In real-time systems with threads, resource locking and
-priority scheduling, one faces the problem of Priority
-Inversion. This problem can make the behaviour of threads
-unpredictable and the resulting bugs can be hard to find. The
-Priority Inheritance Protocol is one solution implemented in many
-systems for solving this problem, but the correctness of this solution
-has never been formally verified in a theorem prover. As already
-pointed out in the literature, the original informal investigation of
-the Property Inheritance Protocol presents a correctness "proof" for
-an incorrect algorithm. In this paper we fix the problem of
-this proof by making all notions precise and implementing a variant of
-a solution proposed earlier. Our formalisation in Isabelle/HOL
-uncovers facts not mentioned in the literature, but also shows how to
-efficiently implement this protocol. Earlier correct implementations
-were criticised as too inefficient. Our formalisation is based on
-Paulson's inductive approach to verifying protocols.
-<BR><BR>
+<ul>
+<li>1. Download Isabelle
+</u>
-The source code can be downloaded
-<A HREF="http://www4.in.tum.de/~urbanc/cgi-bin/repos.cgi/prio">here</A>.
-<BR><BR><BR><BR>
+
</TABLE>
<P><!-- Created: Tue Mar 4 00:23:25 GMT 1997 -->