IOA: A formalization of I/O automata in HOLCF
Author: Olaf Müller
Copyright 1997 Technische Universität München
The distribution contains:
- 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:
Olaf Müller and Tobias Nipkow,
Traces of I/O Automata in Isabelle/HOLCF.
In TAPSOFT'97, Proc. of the 7th International Joint Conference on Theory and Practice of Software Development , LNCS 1224, 1997.
- 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:
Olaf Müller and Tobias Nipkow,
Combining Model Checking and Deduction for I/O Automata .
In TACAS'95, Proc. of the 1st International Workshop on Tools and Algorithms for the Construction and Analysis of Systems , LNCS 1019, 1995.
- A proof of a Network Transmission Protocol (NTP subdirectory) using the theory of IOA described above. For details see:
Tobias Nipkow, Konrad Slind.
I/O Automata in Isabelle/HOL. In Types for Proofs and Programs,
LNCS 996, 1995, 101-119.