equal
deleted
inserted
replaced
247 of the original work (we allow overlapping critical sections) in the theorem prover |
247 of the original work (we allow overlapping critical sections) in the theorem prover |
248 <A HREF="http://isabelle.in.tum.de">Isabelle</A>. |
248 <A HREF="http://isabelle.in.tum.de">Isabelle</A>. |
249 |
249 |
250 In our formalisation we use the inductive method we learned from |
250 In our formalisation we use the inductive method we learned from |
251 <A HREF="https://www.cl.cam.ac.uk/~lp15/">Prof. Larry Paulson</A>. |
251 <A HREF="https://www.cl.cam.ac.uk/~lp15/">Prof. Larry Paulson</A>. |
252 He used this method in order to prove the correctness of security |
252 He used this method in order to prove the correctness of cryptographic |
253 protocols. We have implemented our algorithm on top of the |
253 protocols. We have implemented our algorithm on top of the |
254 the small <A HREF="https://en.wikipedia.org/wiki/Pintos">PINTOS</A> |
254 the small <A HREF="https://en.wikipedia.org/wiki/Pintos">PINTOS</A> |
255 operating system used for teaching (we passed all their test cases and were |
255 operating system used for teaching (we passed all their test cases and were |
256 faster than their reference implementation). |
256 faster than their reference implementation). |
257 |
257 |