Christoph Sprenger  Home/Search
Context
Related
| ltiwww.epfl.ch/~sprenge...tacas98.ps.gz sop.inria.fr/lemme/Chri...tacas98.ps.gz 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: ltiwww.epfl.ch/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We report on the formalisation and correctness proof of a model checker for the modal -calculus in Coq's constructive type theory. Using Coq's extraction mechanism we obtain an executable Caml program, which is added as a safe decision procedure to the system. An example illustrates its application in combination with deduction. 1 Introduction There is an obvious advantage in combining theorem proving and model checking techniques for the verification of reactive systems. The... (Update)
Active bibliography (related documents): More All
0.2: Un Calcul De Constructions Infinies Et Son Application a La. . . - Gimenez (1996) (Correct)
0.2: Formal Verification of Concurrent Programs Based on Type Theory - Yu (1998) (Correct)
0.1: The Coq Proof Assistant - Reference Manual V 5.10 - Cornes, Courant.. (1995) (Correct)
Similar documents based on text: More All
0.3: Design of a proof assistant: Coq version 7 - Filliâtre (Correct)
0.3: Reflecting BDDs in Coq - Verma, Goubault-Larrecq (2000) (Correct)
0.3: A Tutorial on Recursive Types in Coq - Gimenez (1998) (Correct)
BibTeX entry: (Update)
@misc{ sprenger-verified,
author = "Christoph Sprenger",
title = "A verified model checker for the modal µ-calculus in Coq",
url = "citeseer.ist.psu.edu/247877.html" }
Citations (may not include all citations):382 Lambda calculi with types - Barendregt - 1992
266 Information and Computation (context) - Coquand, Huet et al. - 1988
191 Lego proof development system: User's manual (context) - Luo, Pollack - 1992
155 ACM Transactions on Programming Languages and Systems (context) - Clarke, Grumberg et al. - 1994
116 A structural induction theorem for processes (context) - Kurshan, McMillan - 1989
96 Property preserving abstractions for the verification of con.. - Loiseaux, Graf et al. - 1995
91 An integration of model checking with automated proof checki.. - Rajan, Shankar et al. - 1995
87 Verifying properties of large sets of processes with network.. (context) - Wolper, Lovinfosse - 1989
73 Prentice Hall International Series in Computer Science (context) - Milner, Concurrency - 1989
49 Inductive definitions in the system Coq -- rules and propert.. - Paulin-Mohring - 1992
49 ACM Transactions on Programming Languages and Systems (context) - Dams, Grumberg et al. - 1997
47 The Coq Proof Assistant Reference Manual (context) - Barras, Boutin et al. - 1996
45 Synthesis of ML programs in the system coq (context) - Paulin-Mohring, Werner - 1993
39 A note on model checking the modal -calculus (context) - Winskel - 1991
39 Model checking for infinite state systems using data abstrac.. - Dingel, Filkorn - 1995
30 Une Th'eorie des Constructions Inductives (context) - Werner - 1994
29 A short description of another logical framework (context) - Augustsson, Coquand et al. - 1990
26 Extraction de programmes dans le Calcul des Constructions (context) - Paulin-Mohring - 1989
21 Combining model checking and deduction for I/Oautomata - Muller, Nipkow - 1995
13 A preorder for partial process specifications (context) - Cleaveland, Steffen - 1990
12 programs from proofs in the Calculus of Constructions (context) - Paulin-Mohring - 1989
10 ese de preuves de programmes dans le Calcul des Construction.. (context) - Parent - 1995
9 Implementing a model checker for LEGO - Yu, Luo - 1997
1 volume 7 of Cambrdge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
Documents on the same site (http://ltiwww.epfl.ch/index.html): More
Property-Sensitive State Space Reduction - Sprenger, Worytkiewicz (Correct)
Implementation and validation methods applied to SSCOP - Julian Harris (Correct)
A Case for Synchronous Objects in Component-Bound Architectures - Petitpierre (Correct)
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