Possibly infinite sequences in theorem provers: A comparative study

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

Volumn 1275, Issue , 1997, Pages 89-104

  Devillers, Marco ^a   Griffioen, David ^a,b   Müller, Olaf ^c  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b CWI   (Netherlands)

^c TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

COMPARATIVE STUDIES; CONCURRENCY THEORY; HIGHER ORDER LOGIC; ISABELLE; NON-TRIVIAL; PROOF TOOLS; THEOREM PROVERS;

THEOREM PROVING;

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

References (18)

1. Sten Agerholm. A HOL Basis for Reasoning about Functional Programs. PhD thesis, University of Aarhus, Denmark, 1994.
2. Alonzo Church. A formulation of the simple theory of types. J. Symbolic Logic, 5:56-68, 1940.
3. Ching-Tsun Chou and Doron Peled. Formal verification of a partial-order reduction technique for model checking. In T. Margaria and B. Steffen, editors, Proc. 2nd Workshop Toots and Algorithms for the Construction and Analysis of Systems (TACAS’96), volume 1055 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
4. Marco Devillers and David Griffioen. A formalization of finite and infinite sequences in PVS. Technical Report CSI-R9702, Computing Science Institute, University of Nijmegen, 1997.
5. Solomom Feferman. Computation on abstract data types, the extensionai approach, with an application to streams. Annals of Pure and Applied Logic, 81:75-113, 1996.
6. M.C.J. Gordon and T.F. Melham. Introduction to HOL: a theorem-proving environment for higher-order logic. Cambridge University Press, 1993.
7. U. Hensel and B. Jacobs. Proof principles for datatypes with iterated recursion. Technical Report CSI-R9703, Computing Science Institute, University of Nijmegen, 1997.
8. Leslie Lamport. The Temporal Logic of Actions. ACM Transactions on Programming Languages and Systems, 16(3):872-923, May 1994.
9. Francois Leclerc and Christine Paulin-Mohring. Programming with streams in Coq, a case study: the sieve of eratosthenes. In H. Barendregt and T. Nipkow, editors, Proc. Types for Proofs and Programs (TYPES’93), volume 806 of Lecture Notes in Computer Science, 1993.
10. Nancy Lynch and Mark Tuttle. An introduction to Input/Output automata. CWI Quarterly, 2(3):219-246, 1989.
11. Olaf Müller and Tobias Nipkow. Traces of I/O-Automata in Isabelle/HOLCF. In Proc. 7th Int. Joint Conf. on Theory and Practice of Software Development (TAPSOFT’97), Lecture Notes in Computer Science. Springer-Verlag, 1997.
12. Olaf Müller and Konrad Slind. Isabelle/HOL as a platform for partiality. In CADE-13 Workshop: Mechanization of Partial Functions, New Brunswick, pages 85-96, 1996.
13. Tobias Nipkow and Konrad Slind. I/O automata in Isabelle/HOL. In P. Dybjer, B. Nordström, and J. Smith, editors, Types for Proofs and Programs, volume 996 of Lecture Notes in Computer Science, pages 101-119. Springer-Verlag, 1995.
14. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for fault-tolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2):107-125, February 1995.
15. Lawrence C. Paulson. Logic and Computation. Cambridge University Press, 1987.
16. Lawrence C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
17. Lawrence C. Paulson. Mechanizing coinduction and corecursion in higher order logic. J. Automated Reasoning, 7, 1997.
18. Franz Regensburger. HOLCF: Higher Order Logic of Computable Functions. In E.T. Schubert, P.J. 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.