메뉴 건너뛰기




Volumn 2741, Issue , 2003, Pages 297-316

Proof search and proof check for equational and inductive theorems

Author keywords

Automated theorem proving; Computation; Deduction; Induction; Proof assistant; Proof terms; Rewrite rules

Indexed keywords

AUTOMATIC GUIDED VEHICLES; AUTOMATION; CALCULATIONS; ARTIFICIAL INTELLIGENCE; AUTOMATIC PROGRAMMING; CONSTRAINT THEORY; RESEARCH;

EID: 7044249054     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_26     Document Type: Conference Paper
Times cited : (8)

References (40)
  • 3
    • 0033686981 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 9
    • 84957610021 scopus 로고    scopus 로고
    • 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
  • 12
    • 0030101783 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 20
    • 68749097555 scopus 로고    scopus 로고
    • 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
  • 23
    • 0032296538 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 34
    • 49249101269 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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
  • 37
    • 84976823860 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.