An Axiomatization of Linear Temporal Logic in the Calculus of Inductive Constructions

Journal of Logic and Computation

Volumn 13, Issue 6, 2003, Pages 801-813

  Coupet Grimal, Solange ^a  

^a UNIVERSITÉ DE PROVENCE   (France)

Author keywords

Co induction; Formal methods; Temporal logic; Type theory

Indexed keywords

LEAST SQUARES APPROXIMATIONS; LINEAR PROGRAMMING; PROBLEM SOLVING; SET THEORY;

AXIOMATIZATION; POLYMORPHISM;

FORMAL LOGIC;

EID: 0347499565     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/13.6.801     Document Type: Review

References (18)

1. T. Coquand and G. Huet. Constructions: A higher order proof system for mechanizing mathematics. EUROCAL 85, Linz Springer-Verlag LNCS 203, 1985.
2. S. COUPET-GRIMAL. An axiomatization of linear temporal logic. The Coq Users's Contributions, July 2002. http://pauillac.inria.fr/coq/contribs-eng.htlm.
3. S. Coupet-Grimal and C. Nouvel, Formal verification of an incremental garbage collector. The Journal of Logic and Computation, 13, 815-832, 2003.
4. D. M. Gabbay, A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In 7th ACM Symposium on Principles of Programming Languages, pp. 163-173, 1980.
5. E. Giménez, Un Calcul de Constructions Infinies et son application a la vérification de systèmes communicants. Thèse d'université, Ecole Normale Supérieure de Lyon, December 1996.
6. B. Heyd and P. Crégut. A modular coding of unity in Coq. In The 1996 International Conference on Theorem Proving in Higher Order Logics, TPHOL'96, Turku, Finland, August 1996. Springer-Verlag.
7. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27, 333-354, 1983.
8. C. D. Luna. Computation tree logic for reactive systems and timed computaion tree logic for real time systems. The Coq Users's Contributions, March 2000. http://pauillac.inria.fr/coq/contribs-eng.htlm.
9. Z. Manna and A. Pnueli. Verification of concurrent programs: the temporal framework. In The Correctness Problem in Computer Science, R. S. Boyer and J. Moore, eds, Academic Press, London, 1981.
10. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag, 1991.
11. M. Miculan. On the formalization of the modal μ-calculus in the calculus of inductive constructions. Information and Computation, 164, 199-231, 2001.
12. C. Paulin-Mohring. Définitions Inductives en Théorie des Types d'Ordre Supérieur. Habilitation à diriger les recherches, Universié Claude Bernard Lyon 1, December 1996.
13. D. M. Russinoff. A verification system for concurrent programs based on the Boyer-Moore prover. Formal Aspects of Computing, 4, 597-611, 1992.
14. C. Sprenger. A verified model checker for the modal μ-calculus in Coq. In Tools and Algorithms for Construction and Analysis of Systems, 4th International Conference, TACAS'98, volume 1384 of Lecture Notes in Computer Science, pp. 167-183. Springer-Verlag, 1998.
15. M.-O. Stehr. Embedding UNITY into the Calculus of Constructions. Research Report FBI-HH-B-214/98, University of Hamburg, Department of Computer Science, 1998.
16. The Coq Development Team. The Coq Proof Assistant Reference Manual - Version V7.1. Technical report, LogiCal Project-INRIA, 2001.
17. M. Vardi. Branching vs. linear time: final showdown. In The European Joint Conferences on Theory and Practice of Software (Etaps'01), (Invited Lecture), Geneva, 2001.
18. P. Wolper. Using temporal logic can be more expressive. Information and Control, 56, 181-209, 1983.