Formalizing the Metatheory of Logical Calculi and Automatic Provers in Isabelle/HOL (Invited Talk)

被引：25
作者：
Blanchette, Jasmin Christian [1 ]
机构：
[1] Vrije Univ Amsterdam, Dept Comp Sci, Theoret Comp Sci, Amsterdam, Netherlands
来源：
PROCEEDINGS OF THE 8TH ACM SIGPLAN INTERNATIONAL CONFERENCE ON CERTIFIED PROGRAMS AND PROOFS (CPP' 19) | 2019年
基金：
欧洲研究理事会;
关键词：
proof systems; theorem provers; proof assistants; SAT MODULO THEORIES; VERIFICATION; TERMINATION; PROOFS; INCOMPLETENESS; GENERATION; FRAMEWORK; SOLVERS;
D O I：
10.1145/3293880.3294087
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
IsaFoL (Isabelle Formalization of Logic) is an undertaking that aims at developing formal theories about logics, proof systems, and automatic provers, using Isabelle/HOL. At the heart of the project is the conviction that proof assistants have become mature enough to actually help researchers in automated reasoning when they develop new calculi and tools. In this paper, I describe and reflect on three verification subprojects to which I contributed: a first-order resolution prover, an imperative SAT solver, and generalized term orders for lambda-free higher-order logic.
引用
收藏
页码：1 / 13
页数：13
相关论文
共 105 条
[31]   An extensible SAT-solver [J].
Eén, N ;
Sörensson, N .
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 :502-518
[32]   Labelled splitting [J].
Fietzke, Arnaud ;
Weidenbach, Christoph .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2009, 55 (1-2) :3-34
[33]  
Fleury M., 2018, CPP, P158, DOI [10.1145/3167080, DOI 10.1145/3167080]
[34]  
From A.H., 2018, ARCH FORMAL PROOFS
[35]  
From Andreas Halkjaer, 2017, ISABELLE FORMALIZATI
[36]  
From Andreas Halkjaer, 2018, IS WORKSH 2018
[37]  
Gordon M, 2000, FOUNDAT COMPUT, P169
[38]  
Haftmann F, 2010, LECT NOTES COMPUT SC, V6009, P103, DOI 10.1007/978-3-642-12251-4_9
[39]  
Haftmann Florian, 2010, FLOPS 2010
[40]  
Harrison J, 1998, LECT NOTES COMPUT SC, V1479, P153, DOI 10.1007/BFb0055135
12345678910