Traces of i/o-automata in isabelle/HOLCF

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1214, Issue , 1997, Pages 580-594

  Miiller, Olaf ^a   Nipkow, Tobias ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER CIRCUITS;

DOMAIN THEORY; EXTERNAL ACTION; GENERALIZED REFINEMENT; ISABELLE; META-THEORY; THEOREM PROVERS;

SOFTWARE DESIGN;

EID: 84947717135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030627     Document Type: Conference Paper

References (18)

1. M. Abadi and L. Lamport. The existence of refinement mappings. In Proc. 3rd IEEE Symp. LICS, pages 165-177. IEEE Computer Society Press, 1988.
2. S. Brooks. Full abstraction for a shared variable parallel language. In Proe. 8th IEEE Symp. Logic in Computer Science, pages 98-109, 1993.
3. C.-T. Chou and D. Peled. Formal verification of a partial-order reduction technique for model checking. In T. Margaria and B. Steffen, editors, Proc. 2nd TACAS, volume 1055 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
4. I. P. D.J.B. Bosscher and F. Vaandrager. Verification of an audio control protocol. In W. d. R. H. Langmaack and J. Vytopil, editors, Proc. 3rd Int. School and Symposium FTRTFT’94, volume 863 of Lecture Notes in Computer Science, pages 170-192. Springer, 1994.
5. S. Feferman. Computation on abstract data types, the extensional approach, with an application to streams. Annals of Pure and Applied Logic, 81:75-113, 1996.
6. R. Gawlick, R. Segala, J. Sogaard-Andersen, and N. Lynch. Liveness in timed and untimed systems. Technical Report MIT/LCS/TR-587, Laboratory for Computer Science, MIT, Cambridge, MA., 1993. Extended abstract in Proceedings ICALP’94.
7. M. Gordon and T. Melham. Introduction to HOL: a theorem-proving environment for higher-order logic. Cambridge University Press, 1993.
8. P. Loewenstein. A formal theory of simulations between infinite automata. Formal Methods in System Design, 3(1):117-149, 1993.
9. V. Luchangco, E. SSylemez, S. Garland, and N. Lynch. Verifying timing properties of concurrent algorithms. In Proc. 7th Int. Conf. Formal Description Techniques, pages 259-273. IFIP WG6.1, Chapman and Hall, 1994.
10. N. Lynch and M. Tuttle. An introduction to Input/Output automata. CWI Quarterly, 2(3):219-246, 1989.
11. N. Lynch and F. Vaandrager. Forward and backward simulations - part I: Untimed systems. Information and Computation, 121(2):214-233, 1995.
12. O. Miiller and T. Nipkow. Combining model checking and deduction for I/Oautomata. In Proc. 1st Workshop Tools and Algorithms for the Construction and Analysis of Systems, volume 1019 of Lecture Notes in Computer Science, pages 1-16. Springer-Verlag, 1995.
13. T. Nipkow and K. Slind. I/O automata in Isabelle/HOL. In P. Dybjer, B. NordstrSm, and J. Smith, editors, Types for Proofs and Programs, volume 996 of Lecture Notes in Computer Science, pages 101-119. Springer-Verlager 1995.
14. D. V. Oheimb. Datentypspezifikationen in Higher-Order LCF. Master’s thesis, Computer Science Department, Technical University Munich, 1995.
15. L. Paulson. Co-induction and co-recursion in higher-order logic. Technical Report TR-334, Univ. of Cambridge, Computer Lab., 1994.
16. L. C. Paulson. Logic and Computation. Cambridge University Press, 1987.
17. L. C. Paulson. IsabelIe: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
18. F. Regensburger. HOLCF: Higher Order Logic of Computable Functions. In E. Schubert, P. Windley, and J. Alves-Foss, editors, Higher Order Logic Theorem Proving and its Applications volume 971 of Lecture Notes in Computer Science, pages 293-307. Springer-Verlag, 1995.