论文信息 - I/Q Automata in Isabelle/HOL

I/Q Automata in Isabelle/HOL

We have embedded the meta-theory of I/O automata, a model for describing and reasoning about distributed systems, in Isabelle's version of higher order logic. On top of that, we have specified and verified a recent network transmission protocol which achieves reliable communication using single-bit-header packets over a medium which may reorder packets arbitrarily.

Tobias Nipkow | Konrad Slind | T. Nipkow | Konrad Slind

[1] Lawrence C. Paulson,et al. A Fixedpoint Approach to Implementing (Co)Inductive Definitions , 1994, CADE.

[2] Nancy A. Lynch,et al. Verifying timing properties of concurrent algorithms , 1994, FORTE.

[3] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[4] Tobias Nipkow,et al. Formal Verification of Data Type Refinement - Theory and Practice , 1989, REX Workshop.

[5] Butler W. Lampson,et al. Atomic Transactions , 1980, Advanced Course: Distributed Systems.

[6] Nancy A. Lynch,et al. Computer-Assisted Simulation Proofs , 1993, CAV.

[7] Lawrence Charles Paulson,et al. Isabelle: A Generic Theorem Prover , 1994 .

[8] Martín Abadi,et al. The Existence of Refinement Mappings , 1988, LICS.

[9] Nancy A. Lynch,et al. An introduction to input/output automata , 1989 .

[10] Nancy A. Lynch,et al. Reliable communication over unreliable channels , 1994, JACM.

[11] Frits W. Vaandrager,et al. Proof-Checking a Data Link Protocol , 1994, TYPES.

[12] Amy P. Felty,et al. The Coq proof assistant user's guide : version 5.6 , 1990 .