Tobias Nipkow, Konrad Slind  Home/Search
Context Related
| www4.informatik.tu...ind_PoTf1995.ps.gz www4.in.tum.de/pub...Slind_PoTf1995.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: www4.informatik...wSlind_PoTf1995 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . 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. 1 Introduction This paper describes a formalization of Input/Output automata (IOA), a particular model for concurrent and ... (Update)
Context of citations to this paper: More
...those of the former via that relation. In addition to this paper, the mechanization of simulation techniques is also treated in [7, 24, 31, 35]. Hoare triples were introduced in [19] But, as far as we know, using them as a relational formulation of translation of properties is...
Cited by: More
Mechanical Verification of Distributed Algorithms in Higher-Order.. - Chou (1995) (Correct)
Active bibliography (related documents): More All
0.3: A Comparison of Simulation Techniques and Algebraic Techniques .. - Lynch, Segala (1993) (Correct)
0.2: Proof-Checking a Data Link Protocol - Helmink, Sellink, Vaandrager (1994) (Correct)
0.2: The IOA Language and Toolset: Support for Mathematics-Based.. - Garland, Lynch (1998) (Correct)
Similar documents based on text: More All
0.8: IOA: A Language for Specifying, Programming, and.. - Garland, Lynch, Vaziri (1997) (Correct)
0.2: More Church-Rosser Proofs (in Isabelle/HOL) - Nipkow (1996) (Correct)
0.1: Translating IOA automata to PVS - Devillers (1999) (Correct)
BibTeX entry: (Update)
Tobias Nipkow and Konrad Slind, "I/O Automata in Isabelle/HOL", Proc. of TYPES Workshop, 1994. (To appear in Springer-Verlag's LNCS series.) http://citeseer.ist.psu.edu/nipkow95io.html More
@inproceedings{ nipkow94io,
author = "Tobias Nipkow and Konrad Slind",
title = "{I/O} Automata in {Isabelle/{HOL}}",
booktitle = "Proceedings of the International Workshop on Types for Proofs and Programs",
publisher = "Springer-Verlag LNCS 996",
address = "B{\aa}stad, Sweden",
editor = "P. Dybjer and B. Nordstr{\"o}m and J. Smith",
pages = "101--119",
year = "1994",
url = "citeseer.ist.psu.edu/nipkow95io.html" }
Citations (may not include all citations):779 Symbolic model checking: 10 20 states and beyond - Burch, Clarke et al. - 1990
274 The existence of refinement mappings - Abadi, Lamport - 1988
199 An introduction to Input/Output automata (context) - Lynch, Tuttle - 1989
81 Isabelle: A Generic Theorem Prover (context) - Paulson - 1994
57 Proof-checking a data link protocol - Helmink, Sellink et al. - 1994
47 A fixedpoint approach to implementing (context) - Paulson - 1994
41 Reliable communication over unreliable channels - Afek, Attiya et al.
41 Reliable communication over unreliable channels - Attiya, Fekete et al. - 1990
37 The Coq proof assistant user's guide version (context) - Dowek, Felty et al. - 1993
23 and Alan Fekete (context) - Lynch, Merritt et al. - 1994
17 Verifying timing properties of concurrent algorithms - Luchangco, Soylemez et al. - 1994
8 Formal verification of data type refinement --- theory and p.. (context) - Nipkow - 1990
4 Computer-assisted simulation proofs (context) - Sgaard-Andersen, Garland et al. - 1993
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC