src/HOLCF/IOA/README.html
changeset 3071 981258186b71
child 3279 815ef5848324
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/src/HOLCF/IOA/README.html	Wed Apr 30 11:20:15 1997 +0200
@@ -0,0 +1,38 @@
+<HTML><HEAD><TITLE>HOLCF/ReadMe</TITLE></HEAD><BODY>
+
+<H3>IOA: A formalization of I/O automata in HOLCF</H3>
+
+Author:     Olaf Mueller<BR>
+Copyright   1997 Technische Universit&auml;t M&uuml;nchen<P>
+
+Version: 1.0<BR>
+Date: 1.05.97<P>
+
+The distribution contains
+
+<UL>
+  <li> A semantic model of the meta theory of I/O automata including proofs for the refinement notion
+       and the compositionality of the model. For details see: <BR>
+       Olaf M&uuml;ller and Tobias Nipkow,
+       <A HREF="http://www4.informatik.tu-muenchen.de/papers/tapsoft_mueller_1997_Conference.html">Traces of I/O Automata in Isabelle/HOLCF</A>.
+In <i> TAPSOFT'97, Proc. of the 7th  International Joint Conference on Theory and Practice of Software Development </i>, LNCS 1224, 1997.<P>
+
+  <li> A proof of the Alternating Bit Protocol (ABP subdirectory) with unbounded buffers using 
+       a combination of Isabelle and a model checker. This case study is performed within the 
+       theory of IOA described above. For details see:<BR>
+Olaf M&uuml;ller and Tobias Nipkow,
+<A HREF="http://www4.informatik.tu-muenchen.de/papers/MuellerNipkow_TaAf1995.html">Combining Model Checking and Deduction for I/O Automata  </A>.
+In <i> TACAS'95, Proc. of the 1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems </i>, LNCS 1019, 1995.<P>
+   <li> A proof of a Network Transmission Protocol (NTP subdirectory) using the theory of IOA described above. For details see:<BR>
+
+        Tobias Nipkow, Konrad Slind.
+<A HREF=http://www4.informatik.tu-muenchen.de/~nipkow/pubs/ioa.html>
+I/O Automata in Isabelle/HOL</A>. In <i>Types for Proofs and Programs</i>,
+LNCS 996, 1995, 101-119.
+
+</UL>
+
+</BODY></HTML>
+
+
+