-
1
-
-
84947470772
-
Integrating automated and interactive theorem proving
-
W. Bibel and P. Schmitt, editors, Kluwer Academic Publishers
-
W. Ahrendt, B. Beckert, R. Hähnle, W. Menzel, W. Reil, G. Schellhorn, and P. Schmitt. Integrating automated and interactive theorem proving. In W. Bibel and P. Schmitt, editors, Automated - A Basis for Applications, volume 1. Kluwer Academic Publishers, 1998.
-
(1998)
Automated - A Basis for Applications
, vol.1
-
-
Ahrendt, W.1
Beckert, B.2
Hähnle, R.3
Menzel, W.4
Reil, W.5
Schellhorn, G.6
Schmitt, P.7
-
2
-
-
0025212954
-
Explicit substitutions
-
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. In ACM, editor, Conf. Rec. 17th Symp. POPL, pages 31-46, 1990.
-
(1990)
ACM, Editor, Conf. Rec. 17Th Symp. POPL
, pp. 31-46
-
-
Abadi, M.1
Cardelli, L.2
Curien, P.-L.3
Lévy, J.-J.4
-
3
-
-
0033686981
-
A semantic model of types and machine instructions for proof-carrying code
-
January
-
A. W. Appel and A. P. Felty. A semantic model of types and machine instructions for proof-carrying code. In Proc. of 27th POPL, pages 243-253, January 2000.
-
(2000)
Proc. Of 27Th POPL
, pp. 243-253
-
-
Appel, A.W.1
Felty, A.P.2
-
4
-
-
0005440582
-
Foundational proof-carrying code
-
June
-
A. W. Appel. Foundational proof-carrying code. In Proc. 16th LICS, pages 247-258, June 2001.
-
(2001)
Proc. 16Th LICS
, pp. 247-258
-
-
Appel, A.W.1
-
6
-
-
0036995574
-
Automated proof construction in type theory using resolution
-
M. Bezem, D. Hendriks, and H. de Nivelle. Automated proof construction in type theory using resolution. Journal of Automated Reasoning, 29(3-4):253-275, 2002.
-
(2002)
Journal of Automated Reasoning
, vol.29
, Issue.3-4
, pp. 253-275
-
-
Bezem, M.1
Hendriks, D.2
De Nivelle, H.3
-
7
-
-
0037190147
-
ELAN from a rewriting logic point of view
-
July
-
P. Borovansky, C. Kirchner, H. Kirchner, and P.-E. Moreau. ELAN from a rewriting logic point of view. Theoretical Computer Science, (285):155-185, July 2002.
-
(2002)
Theoretical Computer Science
, Issue.285
, pp. 155-185
-
-
Borovansky, P.1
Kirchner, C.2
Kirchner, H.3
Moreau, P.-E.4
-
8
-
-
84999032268
-
Spike: An automatic theorem prover
-
St. Petersburg (Russia), volume 624 of Lecture Notes in Artificial Intelligence, July
-
A. Bouhoula, E. Kounalis, and M. Rusinowitch. Spike: An automatic theorem prover. In Proceedings of the 1st International Conference on Logic Programming and Automated Reasoning, St. Petersburg (Russia), volume 624 of Lecture Notes in Artificial Intelligence, pages 460-462, July 1992.
-
(1992)
Proceedings of the 1St International Conference on Logic Programming and Automated Reasoning
, pp. 460-462
-
-
Bouhoula, A.1
Kounalis, E.2
Rusinowitch, M.3
-
9
-
-
84957610021
-
Using reflection to build efficient and certified decision procedures
-
M. Abadi and T. Ito, editors
-
S. Boutin. Using reflection to build efficient and certified decision procedures. In M. Abadi and T. Ito, editors, Proc. TACS’97, volume 1281 of Lecture Notes in Computer Science, pages 515-529, 1997.
-
(1997)
Proc. TACS’97, Volume 1281 of Lecture Notes in Computer Science
, pp. 515-529
-
-
Boutin, S.1
-
10
-
-
84947815343
-
An interface between clam and HOL
-
J. Grundy and M. Newey, editors
-
R. Boulton, K. Slind, A. Bundy, and M. Gordon. An interface between clam and HOL. In J. Grundy and M. Newey, editors, Proc. of the 11th Int. Conf. TPHOL, volume 1479 of Lecture Notes in Computer Science, pages 87-104, 1998.
-
(1998)
Proc. Of the 11Th Int. Conf. TPHOL, Volume 1479 Of Lecture Notes in Computer Science
, pp. 87-104
-
-
Boulton, R.1
Slind, K.2
Bundy, A.3
Gordon, M.4
-
12
-
-
0030101783
-
Confluence properties of weak and strong calculi of explicit substitutions
-
March
-
P.-L. Curien, T. Hardin, and J.-J. Lévy. Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM, 43(2):362-397, March 1996.
-
(1996)
Journal of the ACM
, vol.43
, Issue.2
, pp. 362-397
-
-
Curien, P.-L.1
Hardin, T.2
Lévy, J.-J.3
-
13
-
-
0003180840
-
A formulation of the simple theory of types
-
A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
-
(1940)
Journal of Symbolic Logic
, vol.5
, pp. 56-68
-
-
Church, A.1
-
14
-
-
4243576523
-
-
Thèse de Doctorat d’Université, Université Henri Poincaré - Nancy 1, October
-
H. Cirstea. Calcul de réécriture: fondements et applications. Thèse de Doctorat d’Université, Université Henri Poincaré - Nancy 1, October 2000.
-
(2000)
Calcul De réécriture: Fondements Et Applications
-
-
Cirstea, H.1
-
17
-
-
0009950979
-
HOL-λσ an intentional first-order expression of higher-order logic
-
G. Dowek, T. Hardin, and C. Kirchner. HOL-λσ an intentional first-order expression of higher-order logic. Mathematical Structures in Computer Science, 11(1):21-45, 2001.
-
(2001)
Mathematical Structures in Computer Science
, vol.11
, Issue.1
, pp. 21-45
-
-
Dowek, G.1
Hardin, T.2
Kirchner, C.3
-
20
-
-
68749097555
-
La part du Calcul
-
Universit´e de Paris 7
-
G. Dowek. La part du Calcul. 1999. Mémoire d’habilitation, Universit´e de Paris 7.
-
(1999)
Mémoire d’habilitation
-
-
Dowek, G.1
-
21
-
-
84944196466
-
Well-founded recursive relations
-
Springer, Paris, France
-
J. Goubault-Larrecq. Well-founded recursive relations. In Proc. 15th Int. Workshop Computer Science Logic (CSL’2001), LNCS 2142, pages 484-497. Springer, Paris, France, 2001.
-
(2001)
Proc. 15Th Int. Workshop Computer Science Logic (CSL’2001), LNCS 2142
, pp. 484-497
-
-
Goubault-Larrecq, J.1
-
23
-
-
0032296538
-
A sceptic’s approach to combining hoal and mapple
-
J. Harrison and L. Théry. A sceptic’s approach to combining hoal and mapple. In Journal of Automated Reasoning, volume 21, pages 279-294, 1998.
-
(1998)
Journal of Automated Reasoning
, vol.21
, pp. 279-294
-
-
Harrison, J.1
Théry, L.2
-
24
-
-
84957798748
-
Integrating gandalf and HOL
-
Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Thery, editors
-
J. Hurd. Integrating gandalf and HOL. In Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Thery, editors, Proc. of TPHOLs’99, volume 1690 of Lecture Notes in Computer Science, pages 311-321, 1999.
-
(1999)
Proc. Of TPHOLs’99, Volume 1690 Of Lecture Notes in Computer Science
, pp. 311-321
-
-
Hurd, J.1
-
25
-
-
0001686885
-
Completion of a set of rules modulo a set of equations
-
J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal of Computing, 15(4):1155-1194, 1986.
-
(1986)
SIAM Journal of Computing
, vol.15
, Issue.4
, pp. 1155-1194
-
-
Jouannaud, J.-P.1
Kirchner, H.2
-
26
-
-
84957409198
-
The HOL-Voss system: Model-checking inside a general-purpose theorem-prover
-
J. Joyce and C. Seger. The HOL-Voss system: Model-checking inside a general-purpose theorem-prover. Lecture Notes in Computer Science, 780:185-198, 1994.
-
(1994)
Lecture Notes in Computer Science
, vol.780
, pp. 185-198
-
-
Joyce, J.1
Seger, C.2
-
27
-
-
0035644347
-
Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associativecommutative theories
-
Report LORIA A01-R- 007
-
H. Kirchner and P.-E. Moreau. Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associativecommutative theories. Journal of Functional Programming, 11(2):207-251, 2001. Report LORIA A01-R- 007.
-
(2001)
Journal of Functional Programming
, vol.11
, Issue.2
, pp. 207-251
-
-
Kirchner, H.1
Moreau, P.-E.2
-
29
-
-
33749399386
-
Termination proof of term rewriting systems with the multiset path ordering: A complete development in the system coq
-
Springer, Edinburgh, UK
-
F. Leclerc. Termination proof of term rewriting systems with the multiset path ordering: A complete development in the system coq. In Proc. 2nd Int. Conf. on Typed Lambda Calculi and Applications (TLCA-95), LNCS 902, pages 312-327. Springer, Edinburgh, UK, 1995.
-
(1995)
Proc. 2Nd Int. Conf. On Typed Lambda Calculi and Applications (TLCA-95), LNCS 902
, pp. 312-327
-
-
Leclerc, F.1
-
30
-
-
0030685617
-
Proof-carrying code
-
January
-
G. C. Necula. Proof-carrying code. In Proc. of 24th POPL, pages 106-119, January 1997.
-
(1997)
Proc. Of 24Th POPL
, pp. 106-119
-
-
Necula, G.C.1
-
32
-
-
84947446429
-
A constructive decision procedure for equalities modulo AC
-
C. Ringeissen, C. Tinelli, R. Treinen, and R. Verma, editors
-
Q.-H. Nguyen. A constructive decision procedure for equalities modulo AC. In C. Ringeissen, C. Tinelli, R. Treinen, and R. Verma, editors, Proc. of 18th UNIF, pages 59-63, 2002.
-
(2002)
Proc. Of 18Th UNIF
, pp. 9-63
-
-
Nguyen, Q.-H.1
-
33
-
-
0036986313
-
External rewriting for skeptical proof assistants
-
Q.-H. Nguyen, C. Kirchner, and H. Kirchner. External rewriting for skeptical proof assistants. Journal of Automated Reasoning, 29(3-4):309-336, 2002.
-
(2002)
Journal of Automated Reasoning
, vol.29
, Issue.3-4
, pp. 309-336
-
-
Nguyen, Q.-H.1
Kirchner, C.2
Kirchner, H.3
-
34
-
-
49249101269
-
Efficient representation and validation of logical proofs
-
June
-
G. Necula and P. Lee. Efficient representation and validation of logical proofs. In Proc. LICS’98, pages 93-104, June 1998.
-
(1998)
Proc. LICS’98
, pp. 93-104
-
-
Necula, G.1
Lee, P.2
-
35
-
-
0013087577
-
A Generic Tableau Prover and its Integration with Isabelle
-
March
-
L. Paulson. A Generic Tableau Prover and its Integration with Isabelle. Journal of Universal Computer Science, 5(3):73-87, March 1999.
-
(1999)
Journal of Universal Computer Science
, vol.5
, Issue.3
, pp. 73-87
-
-
Paulson, L.1
-
36
-
-
84947743461
-
Inductive definitions in the system Coq: Rules and properties
-
M. Bezem and J. F. Groote, editors, Berlin
-
C. Paulin-Mohring. Inductive definitions in the system Coq: Rules and properties. In M. Bezem and J. F. Groote, editors, Proc. of the 1st Int. Conf. TLCA, volume 664 of Lecture Notes in Computer Science, pages 328-345, Berlin, 1993.
-
(1993)
Proc. Of the 1St Int. Conf. TLCA, Volume 664 Of Lecture Notes in Computer Science
, pp. 328-345
-
-
Paulin-Mohring, C.1
-
37
-
-
84976823860
-
Complete sets of reductions for some equational theories
-
G. Peterson and M. E. Stickel. Complete sets of reductions for some equational theories. Journal of the ACM, 28:233-264, 1981.
-
(1981)
Journal of the ACM
, vol.28
, pp. 233-264
-
-
Peterson, G.1
Stickel, M.E.2
-
39
-
-
84947470775
-
Integrated formal verification: Using model checking with automated abstraction, invariant generation, and theorem proving
-
D. Dams, R. Gerth, S. Leue, and M. Massinek, editors
-
J. Rushby. Integrated formal verification: Using model checking with automated abstraction, invariant generation, and theorem proving. In D. Dams, R. Gerth, S. Leue, and M. Massinek, editors, Theoretical and Practical Aspects of SPIN Model Checking, volume 1680 of Lecture Notes in Computer Science, pages 311-321, 1999.
-
(1999)
Theoretical and Practical Aspects of SPIN Model Checking, Volume 1680 of Lecture Notes in Computer Science
, pp. 311-321
-
-
Rushby, J.1
|