# HG changeset patch
# User Christian Urban <christian dot urban at kcl dot ac dot uk>
# Date 1379897652 -3600
# Node ID 84297c4b3727e435b84a94baa58f2dc8a3b02caa
# Parent  dc882c0422e7fad1cf551543121ef731e6e96767
added project

diff -r dc882c0422e7 -r 84297c4b3727 bsc-projects-13.html
--- a/bsc-projects-13.html	Fri Sep 20 13:17:54 2013 +0100
+++ b/bsc-projects-13.html	Mon Sep 23 01:54:12 2013 +0100
@@ -525,6 +525,19 @@
   Well, you must be a hacker; happy to make things.
   </p>
 
+<li> <H4>[CU9] Proving Programs to be Correct</H4>
+
+ <p>
+ I am one of the main developers of the interactive theorem prover
+ <A HREF="http://isabelle.in.tum.de">Isabelle</A>. This theorem prover
+ has been used to establish the correctness of some quite large
+ programs (for example an <A HREF="http://ertos.nicta.com.au/research/l4.verified/">operating system</A>).
+ On a much smaller scale, there are a few programs and underlying algorithms where it
+ is not really understood whether they always compute a correct result. The aim of this
+ project is to completely specify an algorithm in Isabelle and then prove it correct (that is,
+ it always computes the correct result).
+</p>
+
 <li> <H4>Earlier Projects</H4>
 
  I am also open to project suggestions from you. You might find some inspiration from my earlier projects: